Fast payment schemes for truthful mechanisms with verification
From MaRDI portal
Publication:1006066
DOI10.1016/j.tcs.2008.12.024zbMath1166.90363MaRDI QIDQ1006066
Francesco Sorrentino, Gennaro Parlato, Carmine Ventre, Alessandro Ferrante
Publication date: 17 March 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.024
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- A Lower Bound of 1 + φ for Truthful Scheduling Mechanisms
- New Constructions of Mechanisms with Verification
- The absolute center of a network
- STACS 2004
- Automata, Languages and Programming
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies
- Structural Information and Communication Complexity
- STACS 2005
- Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions
- Algorithmic mechanism design