| 2025 | AFT | Single-Token vs Two-Token Blockchain Tokenomics. | Aggelos Kiayias, Philip Lazos, Paolo Penna |
| 2025 | FC | Reward Schemes and Committee Sizes in Proof of Stake Governance. | Georgios Birmpas, Philip Lazos, Evangelos Markakis, Paolo Penna |
| 2025 | FC | Serial Monopoly on Blockchains with Quasi-patient Users. | Paolo Penna, Manvir Schneider |
| 2025 | IJCAI | Airdrop Games. | Sotiris Georganas, Aggelos Kiayias, Paolo Penna |
| 2022 | AISTATS | Statistical and computational thresholds for the planted k-densest sub-hypergraph problem. | Luca Corinzia, Paolo Penna, Wojciech Szpankowski, Joachim M. Buhmann |
| 2021 | ISIT | On maximum-likelihood estimation in the all-or-nothing regime. | Luca Corinzia, Paolo Penna, Wojciech Szpankowski, Joachim M. Buhmann |
| 2019 | CIAC | Independent Lazy Better-Response Dynamics on Network Games. | Paolo Penna, Laurent Viennot |
| 2019 | ESA | Obviously Strategyproof Mechanisms for Machine Scheduling. | Diodato Ferraioli, Adrian Meier, Paolo Penna, Carmine Ventre |
| 2019 | ESA | Optimal Sorting with Persistent Comparison Errors. | Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna |
| 2019 | ISAAC | Dual-Mode Greedy Algorithms Can Save Energy. | Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna, Guido Proietti |
| 2019 | ISIT | Exact Recovery for a Family of Community-Detection Generative Models. | Luca Corinzia, Paolo Penna, Luca Mondada, Joachim M. Buhmann |
| 2018 | OPODIS | Equilibria of Games in Networks for Local Tasks. | Simon Collet, Pierre Fraigniaud, Paolo Penna |
| 2018 | STACS | Optimal Dislocation with Persistent Errors in Subquadratic Time. | Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna |
| 2018 | SOFSEM | Inversions from Sorting with Distance-Based Errors. | Barbara Geissmann, Paolo Penna |
| 2017 | ATMOS | Truthful Mechanisms for Delivery with Agents. | Andreas Brtschi, Daniel Graf, Paolo Penna |
| 2017 | COCOA | Selfish Jobs with Favorite Machines: Price of Anarchy vs. Strong Price of Anarchy. | Cong Chen, Paolo Penna, Yinfeng Xu |
| 2017 | ISAAC | Sorting with Recurrent Comparison Errors. | Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna |
| 2017 | STACS | Energy-Efficient Delivery by Heterogeneous Mobile Agents. | Andreas Brtschi, Jrmie Chalopin, Shantanu Das, Yann Disser, Daniel Graf, Jan Hackfeld, Paolo Penna |
| 2016 | IWOCA | On Computing the Total Displacement Number via Weighted Motzkin Paths. | Andreas Brtschi, Barbara Geissmann, Daniel Graf, Tomas Hruz, Paolo Penna, Thomas Tschager |
| 2016 | SAGT | Bribeproof Mechanisms for Two-Values Domains. | Mats Mihalk, Paolo Penna, Peter Widmayer |
| 2015 | MFCS | On Sampling Simple Paths in Planar Graphs According to Their Lengths. | Sandro Montanari, Paolo Penna |
| 2013 | Algosensors | Data Delivery by Energy-Constrained Mobile Agents. | Jrmie Chalopin, Shantanu Das, Mats Mihalk, Paolo Penna, Peter Widmayer |
| 2013 | ESA | Logit Dynamics with Concurrent Updates for Local Interaction Games. | Vincenzo Auletta, Diodato Ferraioli, Francesco Pasquale, Paolo Penna, Giuseppe Persiano |
| 2013 | SAGT | Imperfect Best-Response Mechanisms. | Diodato Ferraioli, Paolo Penna |
| 2012 | SAGT | Mechanisms for Scheduling with Single-Bit Private Values. | Vincenzo Auletta, George Christodoulou, Paolo Penna |
| 2011 | SPAA | Convergence to equilibrium of logit dynamics for strategic games. | Vincenzo Auletta, Diodato Ferraioli, Francesco Pasquale, Paolo Penna, Giuseppe Persiano |
| 2009 | MFCS | Private Capacities in Mechanism Design. | Vincenzo Auletta, Paolo Penna, Giuseppe Persiano |
| 2008 | ESA | Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions. | Paolo Penna, Carmine Ventre |
| 2008 | SAGT | Alternatives to Truthfulness Are Hard to Recognize. | Vincenzo Auletta, Paolo Penna, Giuseppe Persiano, Carmine Ventre |
| 2007 | WG | An Equivalent Version of the Caccetta-Hggkvist Conjecture in an Online Load Balancing Problem. | Angelo Monti, Paolo Penna, Riccardo Silvestri |
| 2006 | ICALP | New Constructions of Mechanisms with Verification. | Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Giuseppe Persiano, Carmine Ventre |
| 2006 | STACS | The Algorithmic Structure of Group Strategyproof Budget-Balanced Cost-Sharing Mechanisms. | Paolo Penna, Carmine Ventre |
| 2005 | SIROCCO | On Designing Truthful Mechanisms for Online Scheduling. | Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Giuseppe Persiano |
| 2005 | SIROCCO | Free-Riders in Steiner Tree Cost-Sharing Games. | Paolo Penna, Carmine Ventre |
| 2004 | ICALP | The Power of Verification for One-Parameter Agents. | Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Giuseppe Persiano |
| 2004 | STACS | Deterministic Truthful Approximation Mechanisms for Scheduling Related Machines. | Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Giuseppe Persiano |
| 2004 | SPAA | How to route and tax selfish unsplittable traffic. | Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Pino Persiano |
| 2004 | SIROCCO | Sharing the Cost of Multicast Transmissions in Wireless Networks. | Paolo Penna, Carmine Ventre |
| 2004 | WAOA | More Powerful and Simpler Cost-Sharing Methods. | Paolo Penna, Carmine Ventre |
| 2003 | CIAC | XOR-Based Schemes for Fast Parallel IP Lookups. | Gian Carlo Bongiovanni, Paolo Penna |
| 2003 | CIAC | Improving Customer Proximity to Railway Stations. | Evangelos Kranakis, Paolo Penna, Konrad Schlude, David Scot Taylor, Peter Widmayer |
| 2003 | ICALP | Online Load Balancing Made Simple: Greedy Strikes Back. | Pierluigi Crescenzi, Giorgio Gambosi, Gaia Nicosia, Paolo Penna, Walter Unger |
| 2003 | SIROCCO | Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms. | Christoph Ambhl, Andrea E. F. Clementi, Paolo Penna, Gianluca Rossi, Riccardo Silvestri |
| 2003 | WABI | Noisy Data Make the Partial Digest Problem NP-hard. | Mark Cieliebak, Stephan J. Eidenbenz, Paolo Penna |
| 2003 | WAOA | Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms. | Christoph Ambhl, Andrea E. F. Clementi, Paolo Penna, Gianluca Rossi, Riccardo Silvestri |
| 2001 | ISAAC | On the Complexity of Train Assignment Problems. | Thomas Erlebach, Martin Gantenbein, Daniel Hrlimann, Gabriele Neyer, Aris Pagourtzis, Paolo Penna, Konrad Schlude, Kathleen Steinhfel, David Scot Taylor, Peter Widmayer |
| 2001 | STACS | On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs. | Andrea E. F. Clementi, Pierluigi Crescenzi, Paolo Penna, Gianluca Rossi, Paola Vocca |
| 2000 | ESA | The Minimum Range Assignment Problem on Linear Radio Networks. | Andrea E. F. Clementi, Afonso Ferreira, Paolo Penna, Stephane Perennes, Riccardo Silvestri |
| 2000 | ICALP | A Note on Parallel Read Operations on Large Public Databases. | Gian Carlo Bongiovanni, Andrea E. F. Clementi, Paolo Penna |
| 2000 | STACS | The Power Range Assignment Problem in Radio Networks on the Plane. | Andrea E. F. Clementi, Paolo Penna, Riccardo Silvestri |
| 2000 | STACS | Succinct Representations of Model Based Belief Revision. | Paolo Penna |
| 1999 | STACS | Memory Organization Schemes for Large Shared Data: A Randomized Solution for Distributed Memory Machines. | Alexander E. Andreev, Andrea E. F. Clementi, Paolo Penna, Jos D. P. Rolim |
| 1998 | GD | Proximity Drawings: Three Dimensions Are Better than Two. | Paolo Penna, Paola Vocca |
| 1997 | GD | Minimum-Area h-v Drawings of Complete Binary Trees. | Pierluigi Crescenzi, Paolo Penna |
| 1996 | WG | Upward Drawings of Search Trees (Extended Abstract). | Pierluigi Crescenzi, Paolo Penna |