## Carmine Ventre, PhD

##### Reader in Computer Science

##### "Insanity is the inability to communicate your ideas. It's as if you were in a foreign country, able to see and understand everything that's going on around you but incapable of explaining what you need to know or of being helped, because you don't understand the language they speak there."

Paulo Coelho, Veronika Decides to Die

Please find below a list of my publications organized by venue and ordered in reverse chronological order. The authors of *all* my papers are listed alphabetically by surname, as common in Theoretical Computer Science literature.

#### Journal Publications

- P. Krysta and C. Ventre.

"*Combinatorial Auctions with Verification are Tractable.*"

*Theoretical Computer Science*, 571, pp. 21–35, 2015. - F. Grandoni, P. Krysta, S. Leonardi and C. Ventre.

"*Utilitarian Mechanism Design for Multi-Objective Optimization.*"

*SIAM Journal on Computing (SICOMP)*, Vol. 43, No. 4, pp. 1263-1290, 2014. - C. Ventre.

"*Truthful optimization using mechanisms with verification.*"

*Theoretical Computer Science*, 518, pp. 64-79, January, 2014. Preprint available here. - L. Goldberg, P. Goldberg, P. Krysta and C. Ventre.

"*Ranking Games that have Competitiveness-based Strategies.*"

*Theoretical Computer Science*, 476, pp. 24-37, March, 2013. Preprint available on arxiv. - P. Goldberg, R. Savani, T. Sørensen and C. Ventre.

"*On the approximation performance of Fictitious play in finite games.*"

*International Journal of Game Theory*. Volume 42, Issue 4 (2013), pp. 1059-1083. - P. Penna and C. Ventre

"*Optimal Collusion-Resistant Mechanisms with Verification.*"

*Games and Economic Behavior*. Volume 86, July 2014, pp. 491–509. - P. Penna and C. Ventre.

"*Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions.*"

Transactions on Computation Theory. Volume 4 Issue 2, May 2012, Article 6. - P. Briest, M. Hoefer, L. Gualà and C. Ventre.

"*On Stackelberg Pricing with Computationally Bounded Consumers.*"

*Networks*. Volume 60, Number 1, pp. 31-44, 2012. - V. Auletta, P. Penna, G. Persiano and C. Ventre.

"*Alternatives to Truthfulness are Hard to Recognize.*"

*Journal of Autonomous Agents and Multi-Agent Systems (JAAMAS)*. Volume 22, Issue 1 (2011), pp. 200-216. - A. Ferrante, G. Parlato, F. Sorrentino and C. Ventre.

"*Fast Payment Schemes for Truthful Mechanisms with Verification.*"

*Theoretical Computer Science*410(8-10): 886-899 (2009). (preprint)

#### Conference Proceedings

- D. Ferraioli and C. Ventre.

"*Metastability of Asymptotically Well-Behaved Potential Games.*"

Accepted for publication in the proceedings of MFCS 2015. Available on arxiv. - P. Krysta, O. Telelis and C. Ventre.

"*Near-Optimal Approximation Mechanisms for Multi-Unit Combinatorial Auctions.*"

Accepted for publication in the proceedings of IJCAI 2015 as part of the invited "Best Papers From Sister Conferences" track. - D. Fotakis, P. Krysta and C. Ventre.

"*The Power of Verification for Greedy Mechanism Design.*"

In the proceedings of AAMAS 2015, pp. 307-315, 2015. - N. Gatti, M. Rocco, P. Serafino, and C. Ventre.

"*Cascade Model with Contextual Externalities and Bounded User Memory for Sponsored Search Auctions.*"

In the proceedings of AAMAS 2015, pp. 1831-1832, 2015. - P. Serafino and C. Ventre.

"*Truthful Mechanisms without Money for Non-utilitarian Heterogeneous Facility Location.*"

In the proceedings of AAAI-15, pp. 1029-1035, 2015. - D. Ferraioli and C. Ventre. and G. Aranyi.

"*A Mechanism Design Approach to Measure Awareness.*"

In the proceedings of AAAI-15, pp. 886-892, 2015. - P. Serafino and C. Ventre.

"*Heterogeneous Facility Location without Money on the Line.*"

In the proceedings of ECAI 2014, pp. 807-812. (pdf) - P. Serafino and C. Ventre.

"*Truthful mechanisms for the location of different facilities.*"

In the proceedings of AAMAS 2014, pp. 1613-1614. - D. Fotakis, P. Krysta and C. Ventre.

"*Combinatorial Auctions without Money.*"

In the proceedings of AAMAS 2014, pp. 1029-1036. Also available on arxiv. - P. Goldberg and C. Ventre.

"*Using Lotteries to Approximate the Optimal Revenue.*"

In the proceedings of AAMAS 2013, pp. 643-650. Also available on arxiv. - P. Krysta, O. Telelis and C. Ventre.

"*Mechanisms for Multi-Unit Combinatorial Auctions with a Few Distinct Goods.*"

In the proceedings of AAMAS 2013, pp. 691-698.**Best paper award.** - D. Ferraioli, P. Goldberg and C. Ventre.

"*Decentralized Dynamics for Finite Opinion Games.*"

In the proceedings of SAGT 2012. LNCS 7615, pp. 144-155. - P. Goldberg, R. Savani, T. Sørensen and C. Ventre.

"*On the approximation performance of Fictitious play in finite games.*"

In the proceedings of the 19th Annual European Symposium on Algorithms (ESA 2011). LNCS 6942, pp. 93-105. (Available on Arxiv.) - P. Krysta and C. Ventre.

"*Combinatorial Auctions with Verification are Tractable.*"

In the proceedings of the 18th Annual European Symposium on Algorithms (ESA 2010). LNCS 6347, pp. 39-50. (See above for full version.) - L. Goldberg, P. Goldberg, P. Krysta and C. Ventre.

"*Ranking Games that have Competitiveness-based Strategies.*"

In the proceedings of the 11th ACM Conference on Electronic Commerce (EC'10), pp. 335-344, 2010. (For the full version, see above.) - F. Grandoni, P. Krysta, S. Leonardi and C. Ventre.

"*Utilitarian Mechanism Design for Multi-Objective Optimization.*"

In the proceedings of SODA10, pp. 573-584, 2010. (pdf) - P. Briest, M. Hoefer, L. Gualà and C. Ventre.

"*On Stackelberg Pricing with Computationally Bounded Consumers.*"

In the proceedings of the fifth international Workshop on Internet & Network Economics (WINE 2009). LNCS 5929, pp. 42-54. 2009. (See above for the full version.) - C. Ventre and I. Visconti.

"*Co-Sound Zero-Knowledge with Public Keys.*"

In the proceedings of the 2nd African International Conference on Cryptology (AfricaCrypt 2009). LNCS 5580, pp. 287-304. 2009. (Full version in preparation.) - P. Penna and C. Ventre.

"*Optimal Collusion-Resistant Mechanisms with Verification.*"

In the proceedings of the 10th ACM Conference on Electronic Commerce (EC'09), pp. 147-156. 2009. (See above for the full version.) - D. Ferraioli and C. Ventre.

"*On the Price of Anarchy of Restricted Job Scheduling Games.*"

In the proceedings of the 11th Italian Conference on Theoretical Computer Science (ICTCS '09), pp. 113--116, 2009. - P. Penna and C. Ventre.

"*Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions.*"

In the proceedings of the 16th European Symposium on Algorithms (ESA 2008), 2008. LNCS 5193, pp. 708-719, 2008. (See above for the full version.) - V. Auletta, P. Penna, G. Persiano and C. Ventre.

"*Alternatives to Truthfulness are Hard to Recognize.*"

In the proceedings of the First International Symposium on Algorithmic Game Theory (SAGT 2008), 2008. LNCS 4997, pp. 194-205, 2008. (See above for the full version.) - C. Ventre and I. Visconti.

"*Completely Non-Malleable Encryption Revisited.*"

In the proceedings of the 11th International Workshop on Practice and Theory in Public Key Cryptography (PKC 2008), 2008. LNCS 4939, pp. 65-84, 2008. (Full version available upon request.) - C. Ventre.

"*Mechanisms with Verification for Any Finite Domain.*"

In the proceedings of the 2nd international Workshop on Internet & Network Economics (WINE 2006), 2006. LNCS 4286, pp. 37-49, 2006. (See above for the full version.) - V. Auletta, R. De Prisco, P. Penna, G. Persiano and C.Ventre.

"*New Constructions of Mechanisms with Verification.*"

In the proceedings of the 33rd International Colloquium on Automata, Languages and Programming (ICALP 2006). LNCS 4051, pp. 596-607, 2006. (pdf) - P. Penna and C.Ventre.

"*The Algorithmic Structure of Group Strategyproof Budget-Balanced Cost-Sharing Mechanisms.*"

In the proceedings of the 23rd International Symposium on Theoretical Aspects of Computer Science (STACS 2006). LNCS 3884, pp. 337-348, 2006. (ps) - A. Ferrante, G. Parlato, F. Sorrentino and C. Ventre.

"*Improvements for Truthful Mechanisms with Verifiable One-Parameter Selfish Agents.*"

In proceedings of the 3rd Workshop on Approximation and Online Algorithms (WAOA 2005). LNCS 3879, pp. 147-160, 2006. (See above for the full version.) - P. Penna and C. Ventre.

"*Free-riders in Steiner tree cost-sharing games.*"

In proceedings of the 12th Colloquium on Structural Information and Communication (SIROCCO 2005). LNCS 3499, pp. 231-245, 2005. (ps) - P. Penna and C. Ventre.

"*More Powerful and Simpler Cost-Sharing Methods (when cross monotonicity is the wrong way).*"

In the proceedings of the 2nd Workshop on Approximation and Online Algorithms (WAOA 2004), LNCS 3351, pp. 97-110, 2005. (ps) - P. Penna and C. Ventre.

"*Energy-efficient broadcasting in ad-hoc networks: combining MSTs with shortest-path trees.*"

In the proceedings of the ACM Workshop on Performance Evaluation of Wireless Ad Hoc, Sensor, and Ubiquitous Networks (PE-WASUN 2004), ACM, pp. 61-68, 2004. (ps)

Code available here; see the applet running here. - P. Penna and C. Ventre.

"*Sharing the cost of multicast transmissions in wireless networks.*" In the proceedings of the 11th Colloquium on Structural Information and Communication (SIROCCO 2004), LNCS 3104, pp. 255-266, 2004. (ps)

#### Others

- P. Penna and C. Ventre.

"*Some New Ideas for Critical Resource Sharing Involving Selfish Agents.*"

Manuscript, 2005. (ps) - P. Ambrosio and C. Ventre.

"*Congestion and Potential Games.*"

Survey within the GI-Seminar "Game theoretic analyses of the Internet", 2004. (ps)