Skip to main content
SpringerLink
Log in

Efficiency, Fairness and Competitiveness in Nash Bargaining Games

  • Conference paper
Internet and Network Economics (WINE 2008)

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

Included in the following conference series:

  • 2895 Accesses

Abstract

Recently, [8] defined the class of Linear Nash Bargaining Games (LNB) and obtained combinatorial, polynomial time algorithms for several games in this class. [8] also defines two natural subclasses within LNB, UNB and SNB, which contain a number of natural Nash bargaining games. In this paper we define three basic game theoretic properties of Nash bargaining games: price of bargaining, fairness and full competitiveness. We show that for each of these properties, a game in UNB has this property iff it is in SNB.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Chakrabarty, D., Devanur, N.: On competitiveness in uniform utility allocation markets. In: Deng, X., Graham, F.C. (eds.) WINE 2007. LNCS, vol. 4858, pp. 374–380. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  2. Jain, K., Vazirani, V.V.: Equitable cost allocations via primal-dual-type algorithms. In: STOC (2002)

    Google Scholar 

  3. Kalai, E.: Solutions to the bargaining problem. In: Hurwicz, L., Schmeidler, D., Sonnenschein, H. (eds.) Social Goals and Social Organization, pp. 75–105. Cambridge University Press, Cambridge (1985)

    Google Scholar 

  4. Koutsoupias, E., Papadimitriou, C.H.: Worst case equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol. 1563. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  5. Nash, J.F.: The bargaining problem. Econometrica 18, 155–162 (1950)

    Article  MathSciNet  MATH  Google Scholar 

  6. Osborne, M., Rubinstein, A.: A Course in Game Theory. MIT Press, Cambridge (1994)

    MATH  Google Scholar 

  7. Thomson, W., Lensberg, T.: Axiomatic Theory of Bargaining With a Variable Population. Cambridge University Press, Cambridge (1989)

    Book  MATH  Google Scholar 

  8. Vazirani, V.V.: Nash bargaining via flexible budget markets (manuscript, 2008)

    Google Scholar 

  9. von Neumann, J.L., Morgenstern, O.: Theory of games and economic behavior (1944)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Canada

    Deeparnab Chakrabarty

  2. College of Computing, Georgia Institute of Technology, Atlanta, GA 30332–0280

    Gagan Goel, Vijay V. Vazirani & Lei Wang

  3. Institute for Theoretical Computer Science, Tsinghua University, Beijing, China

    Changyuan Yu

Authors
  1. Deeparnab Chakrabarty
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gagan Goel
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Vijay V. Vazirani
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Lei Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Changyuan Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science Division, University of California at Berkeley, Berkeley, CA, USA

    Christos Papadimitriou

  2. Department of Systems Engineering and Engineering Management, The Chinese University of Hong Kong, Shatin, N.T., Hong Kong

    Shuzhong Zhang

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chakrabarty, D., Goel, G., Vazirani, V.V., Wang, L., Yu, C. (2008). Efficiency, Fairness and Competitiveness in Nash Bargaining Games. In: Papadimitriou, C., Zhang, S. (eds) Internet and Network Economics. WINE 2008. Lecture Notes in Computer Science, vol 5385. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92185-1_55

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-92185-1_55

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-92184-4

  • Online ISBN: 978-3-540-92185-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation