Coverart for item
The Resource Algorithmic game theory : 5th International Symposium, SAGT 2012, Barcelona, Spain, October 22-23, 2012. Proceedings, Maria Serna (ed.), (electronic book)

Algorithmic game theory : 5th International Symposium, SAGT 2012, Barcelona, Spain, October 22-23, 2012. Proceedings, Maria Serna (ed.), (electronic book)

Label
Algorithmic game theory : 5th International Symposium, SAGT 2012, Barcelona, Spain, October 22-23, 2012. Proceedings
Title
Algorithmic game theory
Title remainder
5th International Symposium, SAGT 2012, Barcelona, Spain, October 22-23, 2012. Proceedings
Statement of responsibility
Maria Serna (ed.)
Title variation
SAGT 2012
Creator
Contributor
Subject
Genre
Language
eng
Member of
Cataloging source
GW5XE
Dewey number
519.3
Index
index present
LC call number
QA269
LC item number
.S24 2012
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
2012
http://bibfra.me/vocab/lite/meetingName
SAGT 2012
Nature of contents
  • dictionaries
  • bibliography
http://library.link/vocab/relatedWorkOrContributorDate
1959-
http://library.link/vocab/relatedWorkOrContributorName
Serna, Maria
Series statement
  • Lecture notes in computer science,
  • LNCS sublibrary. SL 3, Information systems and application, incl. Internet/Web and HCI
Series volume
7615
http://library.link/vocab/subjectName
  • Game theory
  • Algorithms
Label
Algorithmic game theory : 5th International Symposium, SAGT 2012, Barcelona, Spain, October 22-23, 2012. Proceedings, Maria Serna (ed.), (electronic book)
Instantiates
Publication
Note
International conference proceedings
Antecedent source
unknown
Bibliography note
Includes bibliographical references and author index
Color
multicolored
Contents
  • An Optimal Bound to Access the Core in TU-Games
  • Sylvain Béal, Eric Rémila and Philippe Solal
  • Convergence of Ordered Improvement Paths in Generalized Congestion Games
  • K. Ruben Brokkelkamp and Mees J. de Vries
  • Basic Network Creation Games with Communication Interests
  • Andreas Cord-Landwehr, Martina Hüllmann, Peter Kling and Alexander Setzer
  • Common Knowledge and State-Dependent Equilibria
  • Nuh Aygun Dalkiran, Moshe Hoffman, Ramamohan Paturi, Daniel Ricketts and Andrea Vattani
  • Approximating the Minmax Value of Three-Player Games within a Constant is as Hard as Detecting Planted Cliques
  • Kord Eickmeyer, Kristoffer Arnstfelt Hansen and Elad Verbin
  • A Classification of Weakly Acyclic Games
  • Approximate Well-Supported Nash Equilibria Below Two-Thirds
  • John Fearnley, Paul W. Goldberg, Rahul Savani and Troels Bjerre Sørensen
  • Mechanisms and Impossibilities for Truthful, Envy-Free Allocations
  • Michal Feldman and John Lai
  • Capacitated Network Design Games
  • Michal Feldman and Tom Ron
  • Decentralized Dynamics for Finite Opinion Games
  • Diodato Ferraioli, Paul W. Goldberg and Carmine Ventre
  • On the Hardness of Network Design for Bottleneck Routing Games
  • Dimitris Fotakis, Alexis C. Kaporis, Thanasis Lianeas and Paul G. Spirakis
  • Krzysztof R. Apt and Sunil Simon
  • Ad Auctions with Data
  • Hu Fu, Patrick Jordan, Mohammad Mahdian, Uri Nadav and Inbal Talgam-Cohen, et al.
  • Commodity Auctions and Frugality Ratios
  • Paul W. Goldberg and Antony McCabe
  • On the Communication Complexity of Approximate Nash Equilibria
  • Paul W. Goldberg and Arnoud Pastink
  • Congestion Games with Capacitated Resources
  • Laurent Gourvès, Jérôme Monnot, Stefano Moretti and Nguyen Kim Thang
  • Network Bargaining: Using Approximate Blocking Sets to Stabilize Unstable Instances
  • Jochen Könemann, Kate Larson and David Steiner
  • Selfishness Level of Strategic Games
  • Uniform Price Auctions: Equilibria and Efficiency
  • Evangelos Markakis and Orestis Telelis
  • Minimizing Expectation Plus Variance
  • Marios Mavronicolas and Burkhard Monien
  • A Theoretical Examination of Practical Game Playing: Lookahead Search
  • Vahab Mirrokni, Nithum Thain and Adrian Vetta
  • Krzysztof R. Apt and Guido Schäfer
  • Mechanisms for Scheduling with Single-Bit Private Values
  • Vincenzo Auletta, George Christodoulou and Paolo Penna
  • The Complexity of Decision Problems about Nash Equilibria in Win-Lose Games
  • Vittorio Bilò and Marios Mavronicolas
Control code
SPR814275037
Dimensions
unknown
Extent
1 online resource.
File format
unknown
Form of item
online
Isbn
9783642339967
Level of compression
unknown
Quality assurance targets
not applicable
Reformatting quality
unknown
Reproduction note
Electronic resource.
Sound
unknown sound
Specific material designation
remote
Label
Algorithmic game theory : 5th International Symposium, SAGT 2012, Barcelona, Spain, October 22-23, 2012. Proceedings, Maria Serna (ed.), (electronic book)
Publication
Note
International conference proceedings
Antecedent source
unknown
Bibliography note
Includes bibliographical references and author index
Color
multicolored
Contents
  • An Optimal Bound to Access the Core in TU-Games
  • Sylvain Béal, Eric Rémila and Philippe Solal
  • Convergence of Ordered Improvement Paths in Generalized Congestion Games
  • K. Ruben Brokkelkamp and Mees J. de Vries
  • Basic Network Creation Games with Communication Interests
  • Andreas Cord-Landwehr, Martina Hüllmann, Peter Kling and Alexander Setzer
  • Common Knowledge and State-Dependent Equilibria
  • Nuh Aygun Dalkiran, Moshe Hoffman, Ramamohan Paturi, Daniel Ricketts and Andrea Vattani
  • Approximating the Minmax Value of Three-Player Games within a Constant is as Hard as Detecting Planted Cliques
  • Kord Eickmeyer, Kristoffer Arnstfelt Hansen and Elad Verbin
  • A Classification of Weakly Acyclic Games
  • Approximate Well-Supported Nash Equilibria Below Two-Thirds
  • John Fearnley, Paul W. Goldberg, Rahul Savani and Troels Bjerre Sørensen
  • Mechanisms and Impossibilities for Truthful, Envy-Free Allocations
  • Michal Feldman and John Lai
  • Capacitated Network Design Games
  • Michal Feldman and Tom Ron
  • Decentralized Dynamics for Finite Opinion Games
  • Diodato Ferraioli, Paul W. Goldberg and Carmine Ventre
  • On the Hardness of Network Design for Bottleneck Routing Games
  • Dimitris Fotakis, Alexis C. Kaporis, Thanasis Lianeas and Paul G. Spirakis
  • Krzysztof R. Apt and Sunil Simon
  • Ad Auctions with Data
  • Hu Fu, Patrick Jordan, Mohammad Mahdian, Uri Nadav and Inbal Talgam-Cohen, et al.
  • Commodity Auctions and Frugality Ratios
  • Paul W. Goldberg and Antony McCabe
  • On the Communication Complexity of Approximate Nash Equilibria
  • Paul W. Goldberg and Arnoud Pastink
  • Congestion Games with Capacitated Resources
  • Laurent Gourvès, Jérôme Monnot, Stefano Moretti and Nguyen Kim Thang
  • Network Bargaining: Using Approximate Blocking Sets to Stabilize Unstable Instances
  • Jochen Könemann, Kate Larson and David Steiner
  • Selfishness Level of Strategic Games
  • Uniform Price Auctions: Equilibria and Efficiency
  • Evangelos Markakis and Orestis Telelis
  • Minimizing Expectation Plus Variance
  • Marios Mavronicolas and Burkhard Monien
  • A Theoretical Examination of Practical Game Playing: Lookahead Search
  • Vahab Mirrokni, Nithum Thain and Adrian Vetta
  • Krzysztof R. Apt and Guido Schäfer
  • Mechanisms for Scheduling with Single-Bit Private Values
  • Vincenzo Auletta, George Christodoulou and Paolo Penna
  • The Complexity of Decision Problems about Nash Equilibria in Win-Lose Games
  • Vittorio Bilò and Marios Mavronicolas
Control code
SPR814275037
Dimensions
unknown
Extent
1 online resource.
File format
unknown
Form of item
online
Isbn
9783642339967
Level of compression
unknown
Quality assurance targets
not applicable
Reformatting quality
unknown
Reproduction note
Electronic resource.
Sound
unknown sound
Specific material designation
remote

Library Locations

Processing Feedback ...