An ironing-based approach to adaptive online mechanism design in single-valued domains

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2007, Pages 94-101

  Parkes, David C ^a   Duong, Quang ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DECISION MAKING; MATHEMATICAL TRANSFORMATIONS; MULTI AGENT SYSTEMS; OPTIMIZATION; RANDOM PROCESSES;

MONOTONICITY; SINGLE-VALUED DOMAINS; STOCHASTIC OPTIMIZATION;

ONLINE SYSTEMS;

EID: 36348949117     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. Awerbuch, B.; Azar, Y.; and Meyerson, A. 2003. Reducing truth-telling online mechanisms to online optimization. In Proc. ACM Symposium on Theory of Computing (STOC'03).
2. Babaioff, M.; Lavi, R.; and Pavlov, E. 2005. Mechanism design for single-value domains. In Proc. 20th Nat. Conf. on Artificial Intelligence (AAAI'05), 241-247.
3. Bent, R., and Van Hentenryck, P. 2004. The value of Consensus in online stochastic scheduling. In Proc. 14th Int. Conf. on Automated Planning and Scheduling.
4. Conitzer, V., and Sandholm, T. 2007. Incremental mechanism design. In Proc. 20th International Joint Conference on Artificial Intelligence (IJCAI-07), 1251-1256.
5. Hajiaghayi, M. T.; Kleinberg, R.; Mahdian, M.; and Parkes, D. C. 2005. Online auctions with re-usable goods. In Proc. ACM Conf. on Electronic Commerce, 165-174.
6. Hajiaghayi, M. T.; Kleinberg, R.; and Parkes, D. C. 2004. Adaptive limited-supply online auctions. In Proc. ACM Conf. on Electronic Commerce, 71-80.
7. Kearns, M.; Mansour, Y.; and Ng, A. 1999. A sparse sampling algorithm for near-optimal planning in large Markov Decision Processes. In In Proc. of 16th Int. Joint Conf. on Art. Intell., 1324-1331.
8. Lavi, R., and Nisan, N. 2000. Competitive analysis of incentive compatible on-line auctions. In Proc. 2nd ACM Conf. on Electronic Commerce (EC-00).
9. Myerson, R. B. 1981. Optimal auction design. Mathematics of Operation Research 6:58-73.
10. Pai, M., and Vohra, R. 2006. Notes on optimal dynamic auctions. Kellogg School of Management. Available from the authors.
11. Parkes, D. C., and Singh, S. 2003. An MDP-based approach to Online Mechanism Design. In Proc. 17th Annual Conf. on Neural Inf. Proc. Systems (NIPS'03).
12. Parkes, D. C. 2007. Online mechanisms. In Nisan, N.; Roughgarden, T.; Tardos, E.; and Vazirani, V., eds., Algorithmic Game Theory. Cambridge University Press, chapter 16.
13. Van Hentenryck, P., and Bent, R. 2006. Online Stochastic Combinatorial Optimization. MIT Press.