Publisher
Springer Berlin Heidelberg
Reference24 articles.
1. Lawrence M. Ausubel, “An Efficient Ascending-Bid Auction for Multiple Objects,” Working Paper, University of Maryland, Department of Economics, 1997.
2. Vijay Arya, Naveen Garg, Rohit Khandekar, Adam Meyerson, Kamesh Munagala, Vinayaka Pandit, “Local search heuristics for k-median and facility location problems”, Proceedings of the 33rd ACM symposium on the theory of computing, 2001.
3. Aaron Archer, Christos Papadimitriou, Kunal Talwar, Éva Tardos, “An approximate truthful mechanism for combinatorial auctions with single parameter agents”, To appear in SODA 2003
4. Aaron Archer, Éva Tardos “Truthful mechanisms for one-parameter agents”,Proceedings of the 42nd IEEE annual symposium on Foundations of Computer Science, 2001.
5. Aaron Archer, Éva Tardos “Frugal Path Mechanisms”, SODA 2002.
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献