Algorithmic game theory : 5th International Symposium, SAGT 2012, Barcelona, Spain, October 22-23, 2012. Proceedings / Maria Serna (ed.).
Contributor(s): Serna, MariaMaterial type: TextSeries: SerienbezeichnungLecture notes in computer science: 7615.; LNCS sublibrary: Publisher: Berlin ; New York : Springer, ©2012Description: 1 online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783642339967; 3642339964; 3642339956; 9783642339950Other title: SAGT 2012Subject(s): Game theory -- Congresses | Algorithms -- Congresses | Informatique | Algorithms | Game theory | Computer science | Electronic data processing | Computer simulation | Simulation and Modeling | e-Commerce/e-business | Models and Principles | Computers and Society | Numeric Computing | Probability and Statistics in Computer Science | computerwetenschappen | computer sciences | numerieke methoden | numerical methods | computertechnieken | computer techniques | waarschijnlijkheid | probability | statistiek | statistics | elektronische handel | electronic commerce | computers | samenleving | society | modellen | models | simulatiemodellen | simulation models | Information and Communication Technology (General) | Informatie- en communicatietechnologie (algemeen)Genre/Form: Electronic books. | Conference papers and proceedings. Additional physical formats: Printed edition:: No titleDDC classification: 519.3 LOC classification: QA269 | .S24 2012Other classification: 54.72 | 83.03 Online resources: Click here to access online
|Item type||Current location||Collection||Call number||Status||Date due||Barcode||Item holds|
A Classification of Weakly Acyclic Games / Krzysztof R. Apt and Sunil Simon -- Selfishness Level of Strategic Games / 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 -- 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 -- 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 -- 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 -- 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.
Includes bibliographical references and author index.
This book constitutes the refereed proceedings of the 5th International Symposium on Algorithmic Game Theory, SAGT 2012, held in Barcelona, Spain, in October 2012. The 22 revised full papers presented together with 2 invited lectures were carefully reviewed and selected from 65 submissions. The papers present original research at the intersection of Algorithms and Game Theory and address various current topics such as solution concepts in game theory; efficiency of equilibria and price of anarchy; complexity classes in game theory; computational aspects of equilibria; computational aspects of fixed-point theorems; repeated games; evolution and learning in games; convergence of dynamics; coalitions, coordination and collective action; reputation, recommendation and trust systems; graph-theoretic aspects of social networks; network games; cost-sharing algorithms and analysis; computing with incentives; algorithmic mechanism design; computational social choice; decision theory, and pricing; auction algorithms and analysis; economic aspects of distributed computing; internet economics and computational advertising.