Vai al contenuto principale della pagina

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



(Visualizza formato Marc21)    (visualizza in BIBRAME 2.0)

Creatore: SAGT 2012 (2012 : Barcelona, Spain)
Titolo: Algorithmic game theory [electronic resource] : 5th International Symposium, SAGT 2012, Barcelona, Spain, October 22-23, 2012. Proceedings / Maria Serna (ed.).
Link to work: Algorithmic game theory Visualizza cluster
Pubblicazione: Berlin ; New York : Springer, c2012
Estensione: 1 online resource.
Disciplina: 519.3
Titolo uniforme di collana: Lecture notes in computer science ; 7615.
LNCS sublibrary. SL 3, Information systems and applications, incl. Internet/Web, and HCI.
Genere/Forma: Electronic books
Index term-Uncontrolled: 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
Soggetto non controllato: 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
Termine d'indicizzazione-Occupazione: 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
Classificazione LOC: QA269 .S24 2012
Creatori/Collaboratori: Serna, Maria, , 1959-
Note generali: International conference proceedings.
Contenuto supplementare: Includes bibliographical references and author index.
Nota di contenuto: 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.
Restrizioni accesso: Restricted for use by site license.
Sommario/riassunto: 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.
Forme fisiche agg.: Also available in print.
Requisiti sistema: Mode of access: World Wide Web.
Collana: Lecture notes in computer science, 0302-9743 ; 7615
LNCS sublibrary. SL 3, Information systems and application, incl. Internet/Web and HCI
Varianti del titolo: SAGT 2012
ISBN: 9783642339967 (electronic bk.)
3642339964 (electronic bk.)
9783642339950
Formato: Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione: Inglese
Record Nr.: 9960101483503681
Localizzazioni e accesso elettronico http://hdl.library.upenn.edu/1017.12/1244897
Lo trovi qui: University of Pennsylvania
Item: Permalink to OPAC