Paolo Penna

ORCID

Publication Activity (10 Years)

Years Active: 1996-2024
Publications (10 Years): 61

Top Venues

Publications

Paolo Penna, Manvir Schneider
Serial Monopoly on Blockchains with Quasi-patient Users. CoRR (2024)
Aggelos Kiayias, Philip Lazos, Paolo Penna
Single-token vs Two-token Blockchain Tokenomics. CoRR (2024)
Cong Chen, Paul Giessler, Akaki Mamageishvili, Matús Mihalák, Paolo Penna
Sequential solutions in machine scheduling games. J. Sched. 27 (4) (2024)
Georgios Birmpas, Philip Lazos, Evangelos Markakis, Paolo Penna
Reward Schemes and Committee Sizes in Proof of Stake Governance. CoRR (2024)
Diodato Ferraioli, Adrian Meier, Paolo Penna, Carmine Ventre
New Constructions of Obviously Strategyproof Mechanisms. Math. Oper. Res. 48 (1) (2023)
Lukas Klein, João B. S. Carvalho, Mennatallah El-Assady, Paolo Penna, Joachim M. Buhmann, Paul F. Jaeger
Improving Explainability of Disentangled Representations using Multipath-Attribution Mappings. CoRR (2023)
Lukas Klein, João B. S. Carvalho, Mennatallah El-Assady, Paolo Penna, Joachim M. Buhmann, Paul F. Jaeger
Improving Explainability of Disentangled Representations using Multipath-Attribution Mappings. MIDL (2022)
Luca Corinzia, Paolo Penna, Wojciech Szpankowski, Joachim M. Buhmann
Statistical and computational thresholds for the planted k-densest sub-hypergraph problem. AISTATS (2022)
Enrico Bianchi, Paolo Penna
Optimal Clustering in Stable Instances Using Combinations of Exact and Noisy Ordinal Queries. Algorithms 14 (2) (2021)
Luca Corinzia, Paolo Penna, Wojciech Szpankowski, Joachim M. Buhmann
On maximum-likelihood estimation in the all-or-nothing regime. ISIT (2021)
Diodato Ferraioli, Paolo Penna, Carmine Ventre
Two-Way Greedy: Algorithms for Imperfect Rationality. WINE (2021)
Luca Corinzia, Paolo Penna, Wojciech Szpankowski, Joachim M. Buhmann
On maximum-likelihood estimation in the all-or-nothing regime. CoRR (2021)
Ioannis Anagnostides, Paolo Penna
A Robust Framework for Analyzing Gradient-Based Dynamics in Bilinear Games. CoRR (2020)
Cong Chen, Paolo Penna, Yinfeng Xu
Online scheduling of jobs with favorite machines. Comput. Oper. Res. 116 (2020)
Luca Corinzia, Paolo Penna, Wojciech Szpankowski, Joachim M. Buhmann
Statistical and computational thresholds for the planted k-densest sub-hypergraph problem. CoRR (2020)
Ioannis Anagnostides, Paolo Penna
Solving Zero-Sum Games through Alternating Projections. CoRR (2020)
Diodato Ferraioli, Paolo Penna, Carmine Ventre
Two-way Greedy: Algorithms for Imperfect Rationality. CoRR (2020)
Cong Chen, Paul Giessler, Akaki Mamageishvili, Matús Mihalák, Paolo Penna
Sequential Solutions in Machine Scheduling Games. WINE (2020)
Diodato Ferraioli, Adrian Meier, Paolo Penna, Carmine Ventre
Novel Paradigm for the design of Obviously Strategyproof Mechanisms. ICTCS (2020)
Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna
Optimal Dislocation with Persistent Errors in Subquadratic Time. Theory Comput. Syst. 64 (3) (2020)
Diodato Ferraioli, Adrian Meier, Paolo Penna, Carmine Ventre
Automated Optimal OSP Mechanisms for Set Systems - The Case of Small Domains. WINE (2019)
Paolo Penna, Laurent Viennot
Independent Lazy Better-Response Dynamics on Network Games. CIAC (2019)
Luca Corinzia, Paolo Penna, Luca Mondada, Joachim M. Buhmann
Exact Recovery for a Family of Community-Detection Generative Models. ISIT (2019)
Luca Corinzia, Paolo Penna, Luca Mondada, Joachim M. Buhmann
Exact Recovery for a Family of Community-Detection Generative Models. CoRR (2019)
Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna, Guido Proietti
Dual-Mode Greedy Algorithms Can Save Energy. ISAAC (2019)
Diodato Ferraioli, Adrian Meier, Paolo Penna, Carmine Ventre
Obviously Strategyproof Mechanisms for Machine Scheduling. ESA (2019)
Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna
Optimal Sorting with Persistent Comparison Errors. ESA (2019)
Stefano Leucci, Akaki Mamageishvili, Paolo Penna
approximate for two natural problems. Games Econ. Behav. 111 (2018)
Simon Collet, Pierre Fraigniaud, Paolo Penna
Equilibria of Games in Networks for Local Tasks. OPODIS (2018)
Cong Chen, Paolo Penna, Yinfeng Xu
Online scheduling of jobs with favorite machines. CoRR (2018)
Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna
Optimal Sorting with Persistent Comparison Errors. CoRR (2018)
Paolo Penna
The price of anarchy and stability in general noisy best-response dynamics. Int. J. Game Theory 47 (3) (2018)
Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna
Optimal Dislocation with Persistent Errors in Subquadratic Time. STACS (2018)
Diodato Ferraioli, Adrian Meier, Paolo Penna, Carmine Ventre
On the approximation guarantee of obviously strategyproof mechanisms. CoRR (2018)
Barbara Geissmann, Paolo Penna
Inversions from Sorting with Distance-Based Errors. SOFSEM (2018)
Cong Chen, Paolo Penna, Yinfeng Xu
Selfish Jobs with Favorite Machines: Price of Anarchy vs Strong Price of Anarchy. CoRR (2017)
Stefano Leucci, Akaki Mamageishvili, Paolo Penna
No truthful mechanism can be better than n approximate for two natural problems. CoRR (2017)
Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Daniel Graf, Jan Hackfeld, Paolo Penna
Energy-Efficient Delivery by Heterogeneous Mobile Agents. STACS (2017)
Andreas Bärtschi, Daniel Graf, Paolo Penna
Truthful Mechanisms for Delivery with Agents. ATMOS (2017)
Andreas Bärtschi, Daniel Graf, Paolo Penna
Truthful Mechanisms for Delivery with Mobile Agents. CoRR (2017)
Cong Chen, Paolo Penna, Yinfeng Xu
Selfish Jobs with Favorite Machines: Price of Anarchy vs. Strong Price of Anarchy. COCOA (2) (2017)
Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna
Sorting with Recurrent Comparison Errors. CoRR (2017)
Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna
Sorting with Recurrent Comparison Errors. ISAAC (2017)
Andreas Bärtschi, Barbara Geissmann, Daniel Graf, Tomas Hruz, Paolo Penna, Thomas Tschager
On Computing the Total Displacement Number via Weighted Motzkin Paths. IWOCA (2016)
Vincenzo Auletta, Diodato Ferraioli, Francesco Pasquale, Paolo Penna, Giuseppe Persiano
Convergence to Equilibrium of Logit Dynamics for Strategic Games. Algorithmica 76 (1) (2016)
Barbara Geissmann, Paolo Penna
Sort well with energy-constrained comparisons. CoRR (2016)
Andreas Bärtschi, Barbara Geissmann, Daniel Graf, Tomas Hruz, Paolo Penna, Thomas Tschager
On computing the total displacement number via weighted Motzkin paths. CoRR (2016)
Matús Mihalák, Paolo Penna, Peter Widmayer
Bribeproof Mechanisms for Two-Values Domains. SAGT (2016)
Paul Giessler, Akaki Mamageishvili, Matús Mihalák, Paolo Penna
Sequential Solutions in Machine Scheduling Games. CoRR (2016)
Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Daniel Graf, Jan Hackfeld, Paolo Penna
Energy-efficient Delivery by Heterogeneous Mobile Agents. CoRR (2016)
Pierluigi Crescenzi, Pierre Fraigniaud, Zvi Lotker, Paolo Penna
Core-periphery clustering and collaboration networks. ASONAM (2016)
Simon Collet, Pierre Fraigniaud, Paolo Penna
Local Distributed Algorithms for Selfish Agents. CoRR (2016)
Paolo Penna, Laurent Viennot
Independent lazy better-response dynamics on network games. CoRR (2016)
Akaki Mamageishvili, Paolo Penna
Tighter bounds on the inefficiency ratio of stable equilibria in load balancing games. Oper. Res. Lett. 44 (5) (2016)
Matús Mihalák, Paolo Penna, Peter Widmayer
Bribeproof mechanisms for two-values domains. CoRR (2015)
Diodato Ferraioli, Paolo Penna
Imperfect Best-Response Mechanisms. Theory Comput. Syst. 57 (3) (2015)
Sandro Montanari, Paolo Penna
On Sampling Simple Paths in Planar Graphs According to Their Lengths. MFCS (2) (2015)
Paolo Penna
The price of anarchy and stability in general noisy best-response dynamics. CoRR (2015)
Vincenzo Auletta, George Christodoulou, Paolo Penna
Mechanisms for Scheduling with Single-Bit Private Values. Theory Comput. Syst. 57 (3) (2015)
Vincenzo Auletta, Diodato Ferraioli, Francesco Pasquale, Paolo Penna, Giuseppe Persiano
Logit Dynamics with Concurrent Updates for Local Interaction Potential Games. Algorithmica 73 (3) (2015)
Akaki Mamageishvili, Paolo Penna
Tighter Bounds on the Inefficiency Ratio of Stable Equilibria in Load Balancing Games. CoRR (2015)
Paolo Penna, Carmine Ventre
Optimal collusion-resistant mechanisms with verification. Games Econ. Behav. 86 (2014)
Diodato Ferraioli, Paolo Penna
Imperfect Best-Response Mechanisms. SAGT (2013)
Vincenzo Auletta, Diodato Ferraioli, Francesco Pasquale, Paolo Penna, Giuseppe Persiano
Logit Dynamics with Concurrent Updates for Local Interaction Games. ESA (2013)
Jérémie Chalopin, Shantanu Das, Matús Mihalák, Paolo Penna, Peter Widmayer
Data Delivery by Energy-Constrained Mobile Agents. ALGOSENSORS (2013)
Paolo Penna, Carmine Ventre
Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions. ACM Trans. Comput. Theory 4 (2) (2012)
Vincenzo Auletta, Diodato Ferraioli, Francesco Pasquale, Paolo Penna, Giuseppe Persiano
Reversibility and Mixing Time for Logit Dynamics with Concurrent Updates CoRR (2012)
Vincenzo Auletta, Diodato Ferraioli, Francesco Pasquale, Paolo Penna, Giuseppe Persiano
Convergence to Equilibrium of Logit Dynamics for Strategic Games CoRR (2012)
Vincenzo Auletta, George Christodoulou, Paolo Penna
Mechanisms for Scheduling with Single-Bit Private Values. SAGT (2012)
Diodato Ferraioli, Paolo Penna
Imperfect best-response mechanisms CoRR (2012)
Vincenzo Auletta, Diodato Ferraioli, Francesco Pasquale, Paolo Penna, Giuseppe Persiano
Convergence to equilibrium of logit dynamics for strategic games. SPAA (2011)
Vincenzo Auletta, Paolo Penna, Giuseppe Persiano, Carmine Ventre
A response to "Mechanism Design with Partial Verification and Revelation Principle". Auton. Agents Multi Agent Syst. 22 (1) (2011)
Vincenzo Auletta, Paolo Penna, Giuseppe Persiano, Carmine Ventre
Alternatives to truthfulness are hard to recognize. Auton. Agents Multi Agent Syst. 22 (1) (2011)
Paolo Penna, Guido Proietti, Peter Widmayer
Strongly polynomial-time truthful mechanisms in one shot. Theor. Comput. Sci. 410 (17) (2009)
Paolo Penna, Florian Schoppmann, Riccardo Silvestri, Peter Widmayer
Pseudonyms in Cost-Sharing Games. WINE (2009)
Vincenzo Auletta, Paolo Penna, Giuseppe Persiano
Private Capacities in Mechanism Design. MFCS (2009)
Paolo Penna, Carmine Ventre
Optimal collusion-resistant mechanisms with verification. EC (2009)
Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Giuseppe Persiano
On designing truthful mechanisms for online scheduling. Theor. Comput. Sci. 410 (36) (2009)
Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Giuseppe Persiano
The power of verification for one-parameter agents. J. Comput. Syst. Sci. 75 (3) (2009)
Paolo Penna, Carmine Ventre
Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions. ESA (2008)
Vincenzo Auletta, Paolo Penna, Giuseppe Persiano, Carmine Ventre
Alternatives to Truthfulness Are Hard to Recognize. SAGT (2008)
Vincenzo Auletta, Luca Moscardelli, Paolo Penna, Giuseppe Persiano
Interference Games in Wireless Networks. WINE (2008)
Paolo Penna, S. S. Ravi
Guest editors' introduction. ACM SIGMOBILE Mob. Comput. Commun. Rev. 12 (1) (2008)
Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Giuseppe Persiano
Routing selfish unsplittable traffic. ACM Trans. Algorithms 3 (4) (2007)
Angelo Monti, Paolo Penna, Riccardo Silvestri
An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem. WG (2007)
Pilu Crescenzi, Giorgio Gambosi, Gaia Nicosia, Paolo Penna, Walter Unger
On-line load balancing made simple: Greedy strikes back. J. Discrete Algorithms 5 (1) (2007)
Paolo Penna, Carmine Ventre
The Algorithmic Structure of Group Strategyproof Budget-Balanced Cost-Sharing Mechanisms. STACS (2006)
Paolo Penna, Guido Proietti, Peter Widmayer
Strongly Polynomial-Time Truthful Mechanisms in One Shot. WINE (2006)
Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Giuseppe Persiano, Carmine Ventre
New Constructions of Mechanisms with Verification. ICALP (1) (2006)
Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Giuseppe Persiano
On Designing Truthful Mechanisms for Online Scheduling. SIROCCO (2005)
Pilu Crescenzi, Miriam Di Ianni, Alessandro Lazzoni, Paolo Penna, Gianluca Rossi, Paola Vocca
Equilibria for Broadcast Range Assignment Games in Ad-Hoc Networks. ADHOC-NOW (2005)
Gian Carlo Bongiovanni, Paolo Penna
XOR-Based Schemes for Fast Parallel IP Lookups. Theory Comput. Syst. 38 (4) (2005)
Paolo Penna, Carmine Ventre
Free-Riders in Steiner Tree Cost-Sharing Games. SIROCCO (2005)
Mark Cieliebak, Stephan J. Eidenbenz, Paolo Penna
Partial Digest is hard to solve for erroneous input data. Theor. Comput. Sci. 349 (3) (2005)
Christoph Ambühl, Andrea E. F. Clementi, Paolo Penna, Gianluca Rossi, Riccardo Silvestri
On the approximability of the range assignment problem on radio networks in presence of selfish agents. Theor. Comput. Sci. 343 (1-2) (2005)
Paolo Penna, Paola Vocca
Proximity drawings in polynomial area and volume. Comput. Geom. 29 (2) (2004)
Giovanna Melideo, Paolo Penna, Guido Proietti, Roger Wattenhofer, Peter Widmayer
Truthful Mechanisms for Generalized Utilitarian Problems. IFIP TCS (2004)
Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Giuseppe Persiano
The Power of Verification for One-Parameter Agents. ICALP (2004)
Paolo Penna, Carmine Ventre
Sharing the Cost of Multicast Transmissions in Wireless Networks. SIROCCO (2004)
Paolo Penna, Carmine Ventre
Energy-efficient broadcasting in ad-hoc networks: combining MSTs with shortest-path trees. PE-WASUN (2004)

Paolo Penna.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Paolo Penna