Algorithmic Game Theory - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

22

(FIVE YEARS 0)

H-INDEX

6

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642339950, 9783642339967

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Approximating the Minmax Value of Three-Player Games within a Constant is as Hard as Detecting Planted Cliques

Algorithmic Game Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-642-33996-7_9 ◽

2012 ◽

pp. 96-107

Author(s):

Kord Eickmeyer ◽

Kristoffer Arnstfelt Hansen ◽

Elad Verbin

Download Full-text

On the Communication Complexity of Approximate Nash Equilibria

Algorithmic Game Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-642-33996-7_17 ◽

2012 ◽

pp. 192-203 ◽

Author(s):

Paul W. Goldberg ◽

Arnoud Pastink

Keyword(s):

Nash Equilibria ◽

Communication Complexity ◽

Approximate Nash Equilibria

Download Full-text

Decentralized Dynamics for Finite Opinion Games

Algorithmic Game Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-642-33996-7_13 ◽

2012 ◽

pp. 144-155 ◽

Author(s):

Diodato Ferraioli ◽

Paul W. Goldberg ◽

Carmine Ventre

Download Full-text

On the Hardness of Network Design for Bottleneck Routing Games

Algorithmic Game Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-642-33996-7_14 ◽

2012 ◽

pp. 156-167 ◽

Author(s):

Dimitris Fotakis ◽

Alexis C. Kaporis ◽

Thanasis Lianeas ◽

Paul G. Spirakis

Keyword(s):

Network Design ◽

Download Full-text

A Classification of Weakly Acyclic Games

Algorithmic Game Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-642-33996-7_1 ◽

2012 ◽

pp. 1-12 ◽

Author(s):

Krzysztof R. Apt ◽

Sunil Simon

Download Full-text

Network Bargaining: Using Approximate Blocking Sets to Stabilize Unstable Instances

Algorithmic Game Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-642-33996-7_19 ◽

2012 ◽

pp. 216-226 ◽

Author(s):

Jochen Könemann ◽

Kate Larson ◽

David Steiner

Keyword(s):

Blocking Sets ◽

Network Bargaining

Download Full-text

Convergence of Ordered Improvement Paths in Generalized Congestion Games

Algorithmic Game Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-642-33996-7_6 ◽

2012 ◽

pp. 61-71 ◽

Author(s):

K. Ruben Brokkelkamp ◽

Mees J. de Vries

Keyword(s):

Congestion Games

Download Full-text

The Complexity of Decision Problems about Nash Equilibria in Win-Lose Games

Algorithmic Game Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-642-33996-7_4 ◽

2012 ◽

pp. 37-48 ◽

Author(s):

Vittorio Bilò ◽

Marios Mavronicolas

Keyword(s):

Nash Equilibria ◽

Decision Problems

Download Full-text

Mechanisms for Scheduling with Single-Bit Private Values

Algorithmic Game Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-642-33996-7_3 ◽

2012 ◽

pp. 25-36 ◽

Author(s):

Vincenzo Auletta ◽

George Christodoulou ◽

Paolo Penna

Keyword(s):

Download Full-text

Capacitated Network Design Games

Algorithmic Game Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-642-33996-7_12 ◽

2012 ◽

pp. 132-143 ◽

Author(s):

Michal Feldman ◽

Tom Ron

Keyword(s):

Network Design ◽

Capacitated Network ◽

Capacitated Network Design

Download Full-text