Algorithmic Game Theory [[electronic resource] ] : Second International Symposium, SAGT 2009, Paphos, Cyprus, October 18-20, 2009, Proceedings / / edited by Marios Mavronicolas, Maria Papadoupoulou |
Edizione | [1st ed. 2009.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
Descrizione fisica | 1 online resource (XI, 359 p.) |
Disciplina | 003.3 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer simulation
Application software Computers and civilization Electronic commerce Computer science Numerical analysis Computer Modelling Computer and Information Systems Applications Computers and Society e-Commerce and e-Business Models of Computation Numerical Analysis |
ISBN | 3-642-04645-2 |
Classificazione |
DAT 530f
MAT 920f SK 860 SS 4800 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Monotonicity in Mechanism Design -- Computational Aspects of Equilibria -- A Modular Approach to Roberts’ Theorem -- Characterizing Incentive Compatibility for Convex Valuations -- Truthful Mechanisms for Selfish Routing and Two-Parameter Agents -- Partition Equilibrium -- Better with Byzantine: Manipulation-Optimal Mechanisms -- On the Planner’s Loss Due to Lack of Information in Bayesian Mechanism Design -- Sequential Pivotal Mechanisms for Public Project Problems -- Characterizing the Existence of Potential Functions in Weighted Congestion Games -- Free-Riding and Free-Labor in Combinatorial Agency -- The Cost of Stability in Coalitional Games -- Non-clairvoyant Scheduling Games -- The Balloon Popping Problem Revisited: Lower and Upper Bounds -- Anarchy, Stability, and Utopia: Creating Better Matchings -- Equilibria in Dynamic Selfish Routing -- Stochastic Stability in Internet Router Congestion Games -- Nash Dynamics in Constant Player and Bounded Jump Congestion Games -- Price of Stability in Survivable Network Design -- Games with Congestion-Averse Utilities -- A New Derandomization of Auctions -- The Computational Complexity of Weak Saddles -- Learning and Approximating the Optimal Strategy to Commit To -- Doing Good with Spam Is Hard -- On Profit-Maximizing Pricing for the Highway and Tollbooth Problems -- On the Complexity of Iterated Weak Dominance in Constant-Sum Games -- Swap Bribery -- Performances of One-Round Walks in Linear Congestion Games -- Nash Equilibria and the Price of Anarchy for Flows over Time -- Bayesian Auctions with Friends and Foes -- On Equilibria for ADM Minimization Games. |
Record Nr. | UNISA-996465279503316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Algorithmic game theory : second international symposium, SAGT 2009, Paphos, Cyprus, October 18-20, 2009 ; proceedings / / Marios Mavronicolas, Vicky G. Papadopoulou, eds |
Edizione | [1st ed. 2009.] |
Pubbl/distr/stampa | New York, : Springer, 2009 |
Descrizione fisica | 1 online resource (XI, 359 p.) |
Disciplina | 003.3 |
Altri autori (Persone) |
MavronicolasMarios
PapadopoulouVicky G |
Collana | Lecture notes in computer science |
Soggetto topico |
Game theory
Algorithms |
ISBN | 3-642-04645-2 |
Classificazione |
DAT 530f
MAT 920f SK 860 SS 4800 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Monotonicity in Mechanism Design -- Computational Aspects of Equilibria -- A Modular Approach to Roberts’ Theorem -- Characterizing Incentive Compatibility for Convex Valuations -- Truthful Mechanisms for Selfish Routing and Two-Parameter Agents -- Partition Equilibrium -- Better with Byzantine: Manipulation-Optimal Mechanisms -- On the Planner’s Loss Due to Lack of Information in Bayesian Mechanism Design -- Sequential Pivotal Mechanisms for Public Project Problems -- Characterizing the Existence of Potential Functions in Weighted Congestion Games -- Free-Riding and Free-Labor in Combinatorial Agency -- The Cost of Stability in Coalitional Games -- Non-clairvoyant Scheduling Games -- The Balloon Popping Problem Revisited: Lower and Upper Bounds -- Anarchy, Stability, and Utopia: Creating Better Matchings -- Equilibria in Dynamic Selfish Routing -- Stochastic Stability in Internet Router Congestion Games -- Nash Dynamics in Constant Player and Bounded Jump Congestion Games -- Price of Stability in Survivable Network Design -- Games with Congestion-Averse Utilities -- A New Derandomization of Auctions -- The Computational Complexity of Weak Saddles -- Learning and Approximating the Optimal Strategy to Commit To -- Doing Good with Spam Is Hard -- On Profit-Maximizing Pricing for the Highway and Tollbooth Problems -- On the Complexity of Iterated Weak Dominance in Constant-Sum Games -- Swap Bribery -- Performances of One-Round Walks in Linear Congestion Games -- Nash Equilibria and the Price of Anarchy for Flows over Time -- Bayesian Auctions with Friends and Foes -- On Equilibria for ADM Minimization Games. |
Record Nr. | UNINA-9910484630303321 |
New York, : Springer, 2009 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|