Brief announcement: An incentive-compatible multi-armed bandit mechanism

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2007, Pages 362-363

  Gonen, Rica ^a   Pavlov, Elan ^b  

^a YAHOO RESEARCH   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Incentive compatible; Multi armed bandit; Truthful

Indexed keywords

INCENTIVE COMPATIBLE; MULTI-ARMED BANDIT; TRUTHFUL;

ALGORITHMS; MARKETING; PROBLEM SOLVING; SAMPLING;

SEARCH ENGINES;

EID: 36849075242     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1281100.1281174     Document Type: Conference Paper

References (14)

1. A. Archer, C. Papadimitriou, K. Talwar, and E. Tardos. Au approximate truthful mechanism for combinatorial auctions with, single parameter agents. In Proc. of the 14th SODA, 2003.
2. O. Aggarwal, A. Goel and R. Motwani. Truthful Auctions for Pricing Search Keywords. Proceding of EC'06
3. D. Ariely, G. Loeweustein, and D. Prelec Coherent arbitrariness: Stable demand curves without stable. Quarterly Journal of Economics, 2003
4. D. A. Berry and B. Fristedt. Bandit problems. Sequential allocation of experiments. Chapman and Hall 1985
5. Bergemann, Dirk and Valimaki, Juuso "Learning and Strategic Pricing," emph Econometrica, Econometric Society, vol. 64(5), pages 1125-49, 1996.
6. Dynamic price competition Dirk Bergemann and Juuso Valimaki Journal of Economic Theory, Volume 127, issue 1.pp. 232-263 2006
7. Bergemann and Valimaki Efficient Auctions, Available at: http://papers.ssrn.com/sol3/papers.cfm?abstractid=936633
8. B. Edelman, M. Ostrovsky and M. Schwarz. Internet Advertising and the Generalized Second Price Auction: Selling Billions of Dollars Worth of Keywords. Working paper 2005
9. E. Even-Dar, S. Manor, and Y. Mansour. PAC Bounds for Multi-Armed Bandit and Markov Decision Processes. Proc. COLT 2002
10. J.C. Gittins. Multi-armed Bandit Allocation Indices. Wiley, New York. Mathematical Reviews: MR90e:62113 (1989)
11. R. Gonen. Untruthful Behavior in Google Slot Auctions. Unpublished manuscript 2004
12. R. Kleinberg. Anytime Algorithms for Multi-Armed Bandit Problems. Proceedings of SODA. 2006.
13. S. Pandey, and C. Olston. Handling Advertisements of Unknown Quality in Search Advertising. NIPS 06
14. H. Robbins. Some Aspects of the Sequential Design of Experiments. In Bulletin of the American Mathematical Society, volume 55, pages 527-535,1952.