Strongly polynomial-time truthful mechanisms in one shot

DOI10.1016/j.tcs.2008.12.034zbMath1159.91325OpenAlexW2005359264MaRDI QIDQ1014632

Peter Widmayer, Guido Proietti, Paolo Penna

Publication date: 29 April 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.12.034

zbMATH Keywords

mechanism designalgorithmic game theorydesign and analysis of algorithmsminimum diameter spanning tree

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Games involving graphs (91A43) Computational methods for problems pertaining to game theory, economics, and finance (91-08)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the minimum diameter spanning tree problem
• Finding the most vital node of a shortest path.
• Algorithmic mechanism design (extended abstract)
• State of the Art—Location on Networks: A Survey. Part I: The p-Center and p-Median Problems
• Optimal Auction Design
• Incentives in Teams
• Algorithms, games, and the internet
• Computing and Combinatorics