Algorithmic Game Theory - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783662448021, 9783662448038

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Value of Targeting

Algorithmic Game Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-662-44803-8_17 ◽

2014 ◽

pp. 194-205 ◽

Cited By ~ 8

Author(s):

Kshipra Bhawalkar ◽

Patrick Hummel ◽

Sergei Vassilvitskii

Download Full-text

Recognizing 1-Euclidean Preferences: An Alternative Approach

Algorithmic Game Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-662-44803-8_13 ◽

2014 ◽

pp. 146-157 ◽

Cited By ~ 3

Author(s):

Edith Elkind ◽

Piotr Faliszewski

Keyword(s):

Alternative Approach

Download Full-text

Prediction and Welfare in Ad Auctions

Algorithmic Game Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-662-44803-8_23 ◽

2014 ◽

pp. 267-278 ◽

Cited By ~ 1

Author(s):

Mukund Sundararajan ◽

Inbal Talgam-Cohen

Keyword(s):

Ad Auctions

Download Full-text

Multimarket Oligopolies with Restricted Market Access

Algorithmic Game Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-662-44803-8_16 ◽

2014 ◽

pp. 182-193

Author(s):

Tobias Harks ◽

Max Klimm

Keyword(s):

Market Access

Download Full-text

Walrasian Equilibrium with Few Buyers

Algorithmic Game Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-662-44803-8_15 ◽

2014 ◽

pp. 170-181

Author(s):

Reshef Meir ◽

Moshe Tennenholtz

Keyword(s):

Walrasian Equilibrium

Download Full-text

Approximate Well-Supported Nash Equilibria in Symmetric Bimatrix Games

Algorithmic Game Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-662-44803-8_21 ◽

2014 ◽

pp. 244-254 ◽

Cited By ~ 4

Author(s):

Artur Czumaj ◽

Michail Fasoulakis ◽

Marcin Jurdziński

Keyword(s):

Nash Equilibria ◽

Bimatrix Games

Download Full-text

On the Impossibility of Black-Box Transformations in Mechanism Design

Algorithmic Game Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-662-44803-8_24 ◽

2014 ◽

pp. 279-290 ◽

Cited By ~ 2

Author(s):

Rafael Pass ◽

Karn Seth

Keyword(s):

Mechanism Design ◽

Black Box

Download Full-text

Social Welfare in One-Sided Matchings: Random Priority and Beyond

Algorithmic Game Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-662-44803-8_1 ◽

2014 ◽

pp. 1-12 ◽

Cited By ~ 12

Author(s):

Aris Filos-Ratsikas ◽

Søren Kristoffer Stiil Frederiksen ◽

Jie Zhang

Keyword(s):

Social Welfare ◽

Random Priority

Download Full-text

Clearing Markets via Bundles

Algorithmic Game Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-662-44803-8_14 ◽

2014 ◽

pp. 158-169 ◽

Cited By ~ 2

Author(s):

Michal Feldman ◽

Brendan Lucier

Download Full-text

Short Sequences of Improvement Moves Lead to Approximate Equilibria in Constraint Satisfaction Games

Algorithmic Game Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-662-44803-8_5 ◽

2014 ◽

pp. 49-60 ◽

Cited By ~ 3

Author(s):

Ioannis Caragiannis ◽

Angelo Fanelli ◽

Nick Gravin

Keyword(s):

Constraint Satisfaction

Download Full-text

Algorithmic Game Theory - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Value of Targeting

Recognizing 1-Euclidean Preferences: An Alternative Approach

Prediction and Welfare in Ad Auctions

Multimarket Oligopolies with Restricted Market Access

Walrasian Equilibrium with Few Buyers

Approximate Well-Supported Nash Equilibria in Symmetric Bimatrix Games

On the Impossibility of Black-Box Transformations in Mechanism Design

Social Welfare in One-Sided Matchings: Random Priority and Beyond

Clearing Markets via Bundles

Short Sequences of Improvement Moves Lead to Approximate Equilibria in Constraint Satisfaction Games

Algorithmic Game Theory - Lecture Notes in Computer Science
Latest Publications