Reducing truth-telling online mechanisms to online optimization

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2003, Pages 503-510

  Awerbuch, Baruch ^a   Azar, Yossi ^b   Meyerson, Adam ^c  

^a Johns Hopkins University   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

^c Carnegie Mellon University   (United States)

Author keywords

Auction; Competitive; Mechanism design; On line

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; NETWORK PROTOCOLS; PROBLEM SOLVING;

TRUTHTELLING MECHANISMS;

COMPUTER NETWORKS;

EID: 0038784573     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/780542.780616     Document Type: Conference Paper

References (18)

1. A. Archer and E. Tardos. Frugal path mechanisms. Proceedings of the 13th ACM-SIAM Symposium on Discrete Algorithms, 2002.
2. A. Awerbuch, Y. Azar, A. Blum, and S. Vempala. New approximation guarantees for minimum weight k-trees and prize-collecting salesman. SIAM Journal of Computing, 1999.
3. A. Awerbuch, Y. Azar, and S. Plotkin. Throughput-competitive on-line routing. Proceedings of the 25th ACM Symposium on Theory of Computing, 1993.
4. A. Awerbuch, Y. Azar, S. Plotkin, and O. Waarts. Competitive routing of virtual circuits with unknown duration. Proceedings of the 4th ACM-SIAM Symposium on Discrete Algorithms, 1994.
5. B. Awerbuch. Online algorithms for selective multicast: A survey. Proceedings of the Dagstuhl Workshop on Online Algorithms, 1996.
6. B. Awerbuch and T. Singh. Online algorithms for selective multicast and maximal dense trees. Proceedings of the ACM Symposium on Theory of Computing, 1996.
7. A. Bagchi, A. Chaudhary, R. Garg, M. Goodrich, and V. Kumar. Seller-focused algorithms for online auctioning. In 7th International Workshop on Algorithms and Data Structures (WADS 2001), pages 135-147, 2001.
8. Z. Bar-Yossef, K. Hildrum, and F. Wu. Incentive-compatible online auctions for digital goods. In 13th ACM-SIAM Symp. on Discrete Algorithms, pages 964-970, 2002.
9. E. Clarke. Multipart pricing of public goods. Public Choice, 1971.
10. J. Feigenbaum, C. Papadimitriou, and S. Shenker. Sharing the cost of multicast transactions. Proceedings of the ACM Symposium on Theory of Computing, 2000.
11. J. Feigenbaum, C. Papadimitriou, and S. Shenker. Sharting the cost of multicast transmissions. Proceedings of the 32nd ACM Symposium on Theory of Computing, 2001.
12. A. Goel, M. Henzinger, and S. Plotkin. Online throughput-competitive algorithm for multicast routing and admission control. Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, 1998.
13. A. Goldberg, J. Hartline, and A. Wright. Competitive auctions and digital goods. Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms, 2001.
14. T. Groves. Incentives in teams. Econemetrica, 1973.
15. R. Lavi and N. Nisan. Competitive analysis of incentive compatible on-line auctions. In ACM Conference on Electronic Commerce, pages 233-241, 2000.
16. R. J. Lipton and A. Tomkins. Online interval scheduling. Proceedings of the 5th ACM-SIAM Symposium on Discrete Algorithms, 2001.
17. N. Nisan and A. Ronen. Algorithmic mechanism design. In 31st ACM Symp. on Theory of Computing, pages 129-140, 1999.
18. W. Vickery. Counterspeculation, auctions and competitive sealed tenders. Journal of Finance, 1961.