Learning algorithms for online principal-agent problems (and selling goods online)

ACM International Conference Proceeding Series

Volumn 148, Issue , 2006, Pages 209-216

  Conitzer, Vincent ^a   Garera, Nikesh ^b  

^a Carnegie Mellon University ^*  (United States)

^b Johns Hopkins University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ONLINE SYSTEMS; PRINCIPAL COMPONENT ANALYSIS; PROBLEM SOLVING;

ONLINE SETTING; PRINCIPAL AGENT PROBLEMS; STANDARD BANDIT ALGORITHM;

LEARNING ALGORITHMS;

EID: 34250720060     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1143844.1143871     Document Type: Conference Paper

References (16)

1. Auer, P., Cesa-Bianchi, N., Freund, Y., & Schapire, R. E. (1995). Gambling in a rigged casino: The adversarial multi-arm bandit problem. FOCS (pp. 322-331).
2. Babaioff, M., Lavi, R., & Pavlov, E. (2005). Mechanism design for single-value domains. AAAI (pp. 241-247).
3. Bahar, G., & Tennenholtz, M. (2005). Sequential-simultaneous information elicitation in multi-agent systems. IJCAI (pp. 923-928).
4. Bar-Yossef, Z., Hildrum, K., & Wu, F. (2002). Incentive-compatible online auctions for digital goods. SODA (pp. 964-970).
5. Bartal, Y., Gonen, R., & Mura, P. L. (2004). Negotiation-range mechanisms: Exploring the limits of truthful efficient markets. ACM-EC (pp. 1-8).
6. Blum, A., Kumar, V., Rudra, A., & Wu, F. (2003). Online learning in online auctions. SODA (pp. 202-204).
7. Blumberg, A., & Shelat, A. (2004). Searching for stable mechanisms: Automated design for imperfect players. AAAI (pp. 8-13).
8. Cesa-Bianchi, N., Freund, Y., Haussler, D., Helmbold, D. P., Schapire, R. E., & Warmuth, M. K. (1997). How to use expert advice. Journal of the ACM, 44, 427-485.
9. Conitzer, V., & Sandholm, T. (2004). Self-interested automated mechanism design and implications for optimal combinatorial auctions. ACM-EC (pp. 132-141).
10. de Farias, D. P., & Megiddo, N. (2003). How to combine expert (or novice) advice when actions impact the environment? NIPS.
11. Kleinberg, R., & Leighton, T. (2003). The value of knowing a demand curve: Bounds on regret for on-line posted-price auctions. FOCS (pp. 594-605).
12. Mas-Colell, A., Whinston, M., & Green, J. R. (1995). Microeconomic theory. Oxford University Press.
13. Parkes, D., & Schoenebeck, G. (2004). GROWRANGE: Anytime VCG-based mechanisms. AAAI (pp. 34-41).
14. Porter, R. (2004). Mechanism design for online real-time scheduling. ACM-EC (pp. 61-70).
15. Smorodinsky, R., & Tennenholtz, M. (2004). Sequential information elicitation in multi-agent systems. UAI (pp. 528-535).
16. Zinkevich, M. (2003). Online convex programming and generalized infinitesimal gradient ascent. ICML (pp. 928-936).