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
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.
- Title
- Efficiency, Fairness and Competitiveness in Nash Bargaining Games
- Book Title
- Internet and Network Economics
- Book Subtitle
- 4th International Workshop, WINE 2008, Shanghai, China, December 17-20, 2008. Proceedings
- Pages
- pp 498-505
- Copyright
- 2008
- DOI
- 10.1007/978-3-540-92185-1_55
- Print ISBN
- 978-3-540-92184-4
- Online ISBN
- 978-3-540-92185-1
- Series Title
- Lecture Notes in Computer Science
- Series Volume
- 5385
- Series ISSN
- 0302-9743
- Publisher
- Springer Berlin Heidelberg
- Copyright Holder
- Springer-Verlag Berlin Heidelberg
- Additional Links
- Topics
- Industry Sectors
- eBook Packages
- Editors
-
- Christos Papadimitriou (1)
- Shuzhong Zhang (2)
- Editor Affiliations
-
- 1. Computer Science Division, University of California at Berkeley
- 2. Department of Systems Engineering and Engineering Management, The Chinese University of Hong Kong, Shatin, N.T.
- Authors
-
- Deeparnab Chakrabarty (3)
- Gagan Goel (4)
- Vijay V. Vazirani (4)
- Lei Wang (4)
- Changyuan Yu (5)
- Author Affiliations
-
- 3. Department of Combinatorics and Optimization, University of Waterloo, Waterloo,
- 4. College of Computing, Georgia Institute of Technology, Atlanta, GA 30332–0280
- 5. Institute for Theoretical Computer Science, Tsinghua University, Beijing, China
Continue reading...
To view the rest of this content please follow the download PDF link above.