Game Theory And Mechanism Design Narahari Pdf Free Download

In recent years game theory has had a substantial impact on computer science, especially on Internet- and e-commerce-related issues. Algorithmic Game Theory, first published in 2007, develops the central ideas and results of this exciting area in a clear and succinct manner. More than 40 of the top researchers in this field have written chapters that go from the foundations to the state of the art. Basic chapters on algorithmic methods for equilibria, mechanism design and combinatorial auctions are followed by chapters on important game theory applications such as incentives and pricing, cost sharing, information markets and cryptography and security. This definitive work will set the tone of research for the next few years and beyond. Students, researchers, and practitioners alike need to learn more about these fascinating theoretical developments and their widespread practical application.

'… a tome to be dipped into by researchers and developers who would want to know more about certain aspects of the field and particular 'state-of-the-art' issues and applications.'

Source: Kybernetes

View selected items
Save to my bookmarks
Export citations
Download PDF (zip)
Send to Kindle
Send to Dropbox
Send to Google Drive

Contents

Select Frontmatter

Frontmatter
pp i-iv
- - Get access
- Export citation

Select Contents

Contents
pp v-xii
- - Get access
- Export citation

Select Foreword

Foreword
pp xiii-xvi
- By Christos H. Papadimitriou
- - Get access
- Export citation

Select Preface

Preface
pp xvii-xviii
- By Noam Nisan, School of Computer Science and Engineering Hebrew University of Jerusalem, Tim Roughgarden, Department of Computer Science Stanford University, Éva Tardos, Department of Computer Science Cornell University, Vijay V. Vazirani, College of Computing Georgia Institute of Technology
- - Get access
- Export citation

Select Contributors

Contributors
pp xix-xxi
- - Get access
- Export citation

Select I - Computing in Games

I - Computing in Games
pp 1-2
- - Get access
- Export citation

Select 1 - Basic Solution Concepts and Computational Issues

1 - Basic Solution Concepts and Computational Issues
pp 3-28
- By Éva Tardos, Department of Computer Science Cornell University, Vijay V. Vazirani, College of Computing Georgia Institute of Technology
- - Get access
- Export citation

Select 2 - The Complexity of Finding Nash Equilibria

2 - The Complexity of Finding Nash Equilibria
pp 29-52
- By Christos H. Papadimitriou, Computer Science Division University of California, Berkeley
- - Get access
- Export citation

Select 3 - Equilibrium Computation for Two-Player Games in Strategic and Extensive Form

3 - Equilibrium Computation for Two-Player Games in Strategic and Extensive Form
pp 53-78
- By Bernhard von Stengel, Department of Mathematics London School of Economics
- - Get access
- Export citation

Select 4 - Learning, Regret Minimization, and Equilibria

4 - Learning, Regret Minimization, and Equilibria
pp 79-102
- By Avrim Blum, Department of Computer Science Carnegie Mellon University, Yishay Mansour, School of Computer Science Tel Aviv University
- - Get access
- Export citation

Select 5 - Combinatorial Algorithms for Market Equilibria

5 - Combinatorial Algorithms for Market Equilibria
pp 103-134
- By Vijay V. Vazirani, College of Computing Georgia Institute of Technology
- - Get access
- Export citation

Select 6 - Computation of Market Equilibria by Convex Programming

6 - Computation of Market Equilibria by Convex Programming
pp 135-158
- By Bruno Codenotti, Istituto di Informatica e Telematica, Consiglio Nazionale delle Ricerche, Kasturi Varadarajan, Department of Computer Science University of Iowa
- - Get access
- Export citation

Select 7 - Graphical Games

7 - Graphical Games
pp 159-180
- By Michael Kearns, Department of Computer and Information Science University of Pennsylvania
- - Get access
- Export citation

Select 8 - Cryptography and Game Theory

8 - Cryptography and Game Theory
pp 181-206
- By Yevgeniy Dodis, Department of Computer Science Courant Institute of Mathematical Sciences, New York University, Tal Rabin, T. J. Watson Research Center IBM
- - Get access
- Export citation

Select 9 - Introduction to Mechanism Design (for Computer Scientists)

9 - Introduction to Mechanism Design (for Computer Scientists)
pp 209-242
- By Noam Nisan, School of Computer Science and Engineering Hebrew University of Jerusalem
- - Get access
- Export citation

Select 10 - Mechanism Design without Money

10 - Mechanism Design without Money
pp 243-266
- By James Schummer, M.E.D.S. Kellogg School of Management Northwestern University, Rakesh V. Vohra, M.E.D.S. Kellogg School of Management Northwestern University
- - Get access
- Export citation

Select 11 - Combinatorial Auctions

11 - Combinatorial Auctions
pp 267-300
- By Liad Blumrosen, Microsoft Research Silicon Valley, Noam Nisan, School of Computer Science and Engineering Hebrew University of Jerusalem
- - Get access
- Export citation

Select 12 - Computationally Efficient Approximation Mechanisms

12 - Computationally Efficient Approximation Mechanisms
pp 301-330
- By Ron Lavi, Faculty of Industrial Engineering and Management, The Technion Israel Institute of Technology
- - Get access
- Export citation

Select 13 - Profit Maximization in Mechanism Design

13 - Profit Maximization in Mechanism Design
pp 331-362
- By Jason D. Hartline, Microsoft Research Silicon Valley, Anna R. Karlin, Department of Computer Science and Engineering University of Washington
- - Get access
- Export citation

Select 14 - Distributed Algorithmic Mechanism Design

14 - Distributed Algorithmic Mechanism Design
pp 363-384
- By Joan Feigenbaum, Computer Science Department Yale University, Michael Schapira, School of Computer Science and Engineering The Hebrew University of Jerusalem, Scott Shenker, EECS Department University of California, Berkeley
- - Get access
- Export citation

Select 15 - Cost Sharing

15 - Cost Sharing
pp 385-410
- By Kamal Jain, Microsoft Research Redmond, Mohammad Mahdian, Yahoo! Research Silicon Valley
- - Get access
- Export citation

Select 16 - Online Mechanisms

16 - Online Mechanisms
pp 411-440
- By David C. Parkes, School of Engineering and Applied Sciences Harvard University
- - Get access
- Export citation

Select 17 - Introduction to the Inefficiency of Equilibria

17 - Introduction to the Inefficiency of Equilibria
pp 443-460
- By Tim Roughgarden, Department of Computer Science Stanford University, Éva Tardos, Department of Computer Science Cornell University
- - Get access
- Export citation

Select 18 - Routing Games

18 - Routing Games
pp 461-486
- By Tim Roughgarden, Department of Computer Science Stanford University
- - Get access
- Export citation

Select 19 - Network Formation Games and the Potential Function Method

19 - Network Formation Games and the Potential Function Method
pp 487-516
- By Éva Tardos, Department of Computer Science Cornell University, Tom Wexler, Department of Computer Science Cornell University
- - Get access
- Export citation

Select 20 - Selfish Load Balancing

20 - Selfish Load Balancing
pp 517-542
- By Berthold Vöcking, Department of Computer Science RWTH Aachen University
- - Get access
- Export citation

Select 21 - The Price of Anarchy and the Design of Scalable Resource Allocation Mechanisms

21 - The Price of Anarchy and the Design of Scalable Resource Allocation Mechanisms
pp 543-568
- By Ramesh Johari, Department of Management Science and Engineering Stanford University
- - Get access
- Export citation

Select IV - Additional Topics

IV - Additional Topics
pp 569-570
- - Get access
- Export citation

Metrics

Altmetric attention score

Full text views

Full text views help

Total number of HTML views: 0

Total number of PDF views: 0 *

Loading metrics...

* Views captured on Cambridge Core between #date#. This data will be updated every 24 hours.

Usage data cannot currently be displayed.