Skip to main content

Mixed Strategies in Combinatorial Agency

(Extended Abstract)

  • Conference paper
Internet and Network Economics (WINE 2006)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4286))

Included in the following conference series:

Abstract

We study a setting where a principal needs to motivate a team of agents whose combination of hidden efforts stochastically determines an outcome. In a companion paper we devise and study a basic “combinatorial agency” model for this setting, where the principal is restricted to inducing a pure Nash equilibrium. Here, we show that the principal may possibly gain from inducing a mixed equilibrium, but this gain can be bounded for various families of technologies (in particular if a technology has symmetric combinatorial structure). In addition, we present a sufficient condition under which mixed strategies yield no gain to the principal.

A full version of this paper is available at the authors’ web sites. All proofs and some additional results appear in the full version.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aumann, R.: Acceptable Points in General Cooperative n-Person Games. In: Contributions to the Theory of Games, vol. 4 (1959)

    Google Scholar 

  2. Babaioff, M., Feldman, M., Nisan, N.: Combinatorial agency. In: The 7th ACM conference on Electronic Commerce, pp. 18–28 (2006)

    Google Scholar 

  3. Che, Y.K., Yoo, S.W.: Optimal Incentives in Teams. American Economic Review 91, 525–541 (2001)

    Article  Google Scholar 

  4. Feldman, M., Chuang, J., Stoica, I., Shenker, S.: Hidden-Action in Multi-Hop Routing. In: ACM EC 2005, pp. 117–126 (2005)

    Google Scholar 

  5. Holmstrom, B.: Moral Hazard in Teams. Bell Journal of Economics 13, 324–340 (1982)

    Article  Google Scholar 

  6. Itoh, H.: Incentives to Help Multi-Agent Situations. Econometrica 59, 611–636 (1991)

    Article  MATH  Google Scholar 

  7. Mass-Colell, A., Whinston, M., Green, J.: Microeconomic Theory. Oxford University Press, Oxford (1995)

    Google Scholar 

  8. Nisan, N., Ronen, A.: Algorithmic mechanism design. Games and Economic Behaviour 35, 166–196 (2001); A preliminary version appeared in STOC 1999

    Article  MATH  MathSciNet  Google Scholar 

  9. Strausz, R.: Moral hazard in sequential teams. Departmental Working Paper. Free University of Berlin (1996)

    Google Scholar 

  10. Winter, E.: Incentives and Discrimination. American Economic Review 94, 764–773 (2004)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Babaioff, M., Feldman, M., Nisan, N. (2006). Mixed Strategies in Combinatorial Agency. In: Spirakis, P., Mavronicolas, M., Kontogiannis, S. (eds) Internet and Network Economics. WINE 2006. Lecture Notes in Computer Science, vol 4286. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11944874_32

Download citation

  • DOI: https://doi.org/10.1007/11944874_32

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-68138-0

  • Online ISBN: 978-3-540-68141-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics