Carmine Ventre, PhD

Ciao, welcome to my homepage! I hold a PostDoctoral research fellowship within EcCo group in connection with an EPSRC-funded project "Efficient Decentralised Approaches in Algorithmic Game Theory." I moved to Liverpool from Salerno (Italy) to join the CTAG research group and work on a DFG-funded project "Algorithmic Tools for Games with Applications to E-Commerce and Networks" within Emmy Noether Program first and later on an EPSRC-funded project "Algorithmic Mechanism Design and Optimization Problems with Economic Applications."

My CV is available here.

Program Committees: ACM EC12, WAOA 2011, SAGT 2009, SOFSEM 2009 (Special Track on Game Theoretic Aspects of E-Commerce).

Organization Committees: DYNAMO 2007, AESS 2007.

Interests

• Algorithmic Game Theory, Micro Economics and the Internet
• Algorithms and Complexity
• Cryptography
• Algorithms for Wireless Networks

Papers

• P. Penna and C. Ventre. "Sharing the cost of multicast transmissions in wireless networks."
  In  Proc. of the 11th Colloquium on Structural Information and Communication (SIROCCO 2004), LNCS 3104, pp. 255-266, 2004.
  Also available as Technical Report of the University of Salerno, 2003. (ps)
• P. Penna and C. Ventre. "Energy-efficient broadcasting in ad-hoc networks: combining MSTs with shortest-path trees."
  In the Proc. of the ACM Workshop on Performance Evaluation of Wireless Ad Hoc, Sensor, and Ubiquitous Networks (PE-WASUN 2004), ACM, pp. 61-68, 2004.
  Also available as Technical Report of the University of Salerno, 2003. (ps)
• P. Ambrosio and C. Ventre. "Congestion and Potential Games."
  Survey within the GI-Seminar "Game theoretic analyses of the Internet", 2004. (ps)
• P. Penna and C. Ventre. "More Powerful and Simpler Cost-Sharing Methods (when cross monotonicity is the wrong way)."
  In the Proc. of the 2nd Workshop on Approximation and Online Algorithms (WAOA 2004), LNCS 3351, pp. 97-110, 2005.
  Also available as Technical Report of the European Project CRESCCO, 2004. (ps)
• P. Penna and C. Ventre. "Free-riders in Steiner tree cost-sharing games."
  In Proc. of the 12th Colloquium on Structural Information and Communication (SIROCCO 2005). LNCS 3499, pp. 231-245, 2005.
  Also available as Technical Report of the European Project CRESCCO, 2005. (ps)
• A. Ferrante, G. Parlato, F. Sorrentino and C. Ventre. "Improvements for Truthful Mechanisms with Verifiable One-Parameter Selfish Agents."
  In Proc. of the 3rd Workshop on Approximation and Online Algorithms (WAOA 2005). LNCS 3879, pp. 147-160, 2006.
  Also available as Technical Report, 2005 (full version below recommended). (ps)
  
• 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). (ps preprint)
• P. Penna and C. Ventre. "Some New Ideas for Critical Resource Sharing Involving Selfish Agents."
  Manuscript, 2005. (ps)
• P. Penna and C.Ventre. "The Algorithmic Structure of Group Strategyproof Budget-Balanced Cost-Sharing Mechanisms."
  In the Proc. of the 23rd International Symposium on Theoretical Aspects of Computer Science (STACS 2006). LNCS 3884, pp. 337-348, 2006.
  Full version available as Technical Report, 2005. (ps)
• V. Auletta, R. De Prisco, P. Penna, G. Persiano and C.Ventre. "New Constructions of Mechanisms with Verification."
  In the Proc. of the 33rd International Colloquium on Automata, Languages and Programming (ICALP 2006). LNCS 4051, pp. 596-607, 2006.
  Full version available as Technical Report, 2005. (pdf)
• C. Ventre. "Mechanisms with Verification for Any Finite Domain."
  In the Proc. of the 2nd international Workshop on Internet & Network Economics (WINE 2006), 2006. LNCS 4286, pp. 37-49, 2006.
  Full version available as Technical Report, 2006.(pdf)
• C. Ventre. "Algorithms for Incentive-Based Computing."
  PhD Thesis, 2007. (pdf)
• C. Ventre and I. Visconti. "Completely Non-Malleable Encryption Revisited."
  In the Proc. of the 11th International Workshop on Practice and Theory in Public Key Cryptography (PKC 2008), 2008. LNCS 4939, pp. 65-84, 2008.
• V. Auletta, P. Penna, G. Persiano and C. Ventre. "Alternatives to Truthfulness are Hard to Recognize."
  In the Proc. of the First International Symposium on Algorithmic Game Theory (SAGT 2008), 2008. LNCS 4997, pp. 194-205, 2008.
• P. Penna and C. Ventre. "Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions."
  In the Proc. of the 16th European Symposium on Algorithms (ESA 2008), 2008. LNCS 5193, pp. 708-719, 2008.
• D. Ferraioli and C. Ventre. "On the Price of Anarchy of Restricted Job Scheduling Games."
  In the Proc. of the 11th Italian Conference on Theoretical Computer Science (ICTCS '09), pp. 113--116, 2009.
• 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.
• 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.
• 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.
• 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)
• 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.
• 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.
• 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.
  Paper available on Arxiv.

Talks

• "Sharing the cost of multicast transmission in wireless networks" in the 2nd CRESCCO Workshop. Athens (Greece). December 6-8, 2003. (ppt)
• "Sharing the cost of multicast transmission in wireless networks" in SIROCCO 2004. Smonelice Castle (Slovak Republic). June 21-23, 2004. (ppt)
• "An introduction to Congestion and Crowding games" in GI-Seminar "Game theoretic analyses of the Internet". Dagstuhl Schoss (Germany). September 1, 2004. (ppt) (pdf)
• "More Powerful and Simpler Cost-Sharing Methods" in ALGO 2004. Bergen (Norway). September 15, 2004. (ppt)
• "Energy-efficient broadcasting in ad-hoc networks: combining MSTs with shortest-path trees" in PE-WASUN 2004. Venice. October 7, 2004. (ppt)
• "Improvements for Truthful Mechanisms with Verifiable One-Parameter Selfish Agents" in ALGO 2005. Palma de Mallorca (Spain). October 7, 2005. (ppt)
• "The Algorithmic Structure of Group Strategyproof Budget-Balanced Cost-Sharing Mechanisms" in STACS 2006. Marseille (France). February 24, 2006. (ppt)
  Same talk has been given as welcome talk in Distributed Computing Group (DCG) in ETH, Zurich. March 7, 2006.
• "New Results on PA/CCA Encryption" in ECRYPT Autumn International School on Zero Knowledge: Foundations and Applications. Bertinoro (Italy). November 1, 2006. (Disclaimer: this is an informal talk for an, at the time, ongoing research.)(ppt)
• "Algorithms for Selfish Agents" (abstract) at Computer Science Division of Physics Department of Università "Federico II", Napoli. Invited and hosted by Clemente Galdi. November 27, 2006. (ppt)
• "Mechanisms with Verification for Any Finite Domain" in WINE 2006. Patras (Greece). December 15, 2006. (ppt)
• "Algorithms for Incentive-Based Computing." PhD Defense Talk. Salerno. April 11, 2007. (ppt)
• "(Optimal) Collusion-Resistant Mechanisms with Verification" in DYNAMO 2007. Salerno. May 7, 2007. (ppt)
• "Mechanisms with Verification" in CTAG Seminars. Liverpool. January 31, 2008. (ppt)
• "Alternatives to Truthfulness are Hard to Recognize" in SAGT 2008. Paderborn (Germany). May 1, 2008. (ppt)
  Same talk has been given in COMSOC-2008. Liverpool. September 5, 2008.
• "Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions" in ESA 2008. Karlsruhe (Germany). September 17, 2008. (pptx)
  An extended talk has been given in CTAG Seminars. Liverpool. October 16, 2008. (pptx)
• "Optimal Collusion-Resistant Mechanisms with Verification" in ACM EC 2009. Stanford. July 9, 2009. (pptx)
• "Utilitarian Mechanism Design for Multi-Objective Optimization" in SODA10. Austin (Texas). January 18, 2010. (pptx)
  Extended talks have been given at LIAFA and LIP6 labs in March 2011.
• "Ranking Games that have Competitiveness-based Strategies" in EC'10. Cambridge (MA). June 11, 2010. (ppt)
  Extended talks have been given at BCTCS 2010 and SCEG'10. (pptx)
• "On the approximation performance of Fictitious play in finite games" in ESA 2011. Saarbrucken (Germany). September 5, 2011. (pptx)

Contact information

Carmine Ventre
Computer Science Department
University of Liverpool
Ashton Building
Ashton Street
Liverpool
L69 3BX
UK
e-mail: Carmine.Ventre at liverpool.ac.uk
e-mail2: carmine.ventre at gmail.com
MSN contact: ventre at jumpy.it
tel: +44-151-7954284