Chapter

Internet and Network Economics

Volume 5385 of the series Lecture Notes in Computer Science pp 498-505

Efficiency, Fairness and Competitiveness in Nash Bargaining Games

  • Deeparnab ChakrabartyAffiliated withDepartment of Combinatorics and Optimization, University of Waterloo
  • , Gagan GoelAffiliated withCollege of Computing, Georgia Institute of Technology
  • , Vijay V. VaziraniAffiliated withCollege of Computing, Georgia Institute of Technology
  • , Lei WangAffiliated withCollege of Computing, Georgia Institute of Technology
  • , Changyuan YuAffiliated withInstitute for Theoretical Computer Science, Tsinghua University

* Final gross prices may vary according to local VAT.

Get Access

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.