Algorithmic Game Theory: Second International Symposium, SAGT 2009, Paphos, Cyprus, October 18-20, 2009, Proceedings

ISBN-13: 9783642046445 / Angielski / Miękka / 2009 / 359 str.

Marios Mavronicolas;Maria Papadoupoulou

Opis

This volume contains the papers presented at the Second International Sym- sium on Algorithmic Game Theory (SAGT 2009), which was held on October 18-20, 2009, in Paphos, Cyprus. This event followed the ?rst, very successful SAGT symposium, which took place in Paderborn, Germany, last year. The purpose of SAGT is to bring together researchers from computer s- ence, economics and mathematics to present and discuss originalresearchat the intersection of algorithms and game theory. It has been intended to cover all important areas such as solution concepts, game classes, computation of equil- riaandmarketequilibria, algorithmicmechanismdesign, automatedmechanism design, convergenceandlearningingames, complexityclassesingametheory, - gorithmicaspectsof?xed-pointtheorems, mechanisms, incentivesandcoalitions, cost-sharing algorithms, computational problems in economics, ?nance, decision theory and pricing, computational social choice, auction algorithms, price of - archyand its relatives, representationsof games and their complexity, economic aspects of distributed computing and the internet, congestion, routing and n- work design and formation games and game-theoretic approaches to networking problems. Approximately55submissionstoSAGT2009 werereceived.Eachsubmission was reviewed by at least three Program Committee members. The Program Committee decided to accept 29 papers. Out of these, a small number will be invited to a Special Issue of the Theory of Computing Systems journal with selected papers from SAGT 2009. The program of SAGT 2009 featured three invited talks from three outstanding researchers in algorithmic game theory: Elias Koutsoupias, Dov Monderer and Mihalis Yannakakis. We are very grateful toElias, DovandMihalisforjoiningusinPaphosandfortheirexcellentlectures.

Spis treści

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.

Blurb

This book constitutes the refereed proceedings of the Second International Symposium on Algorithmic Game Theory, SAGT 2009, held in Paphos, Cyprus, in October 2009.

The 29 revised full papes presented together with 3 invited lectures were carefully reviewed and selected from 55 submissions. The papers are intended to cover all important areas such as solution concepts, game classes, computation of equilibria and market equilibria, algorithmic mechanism design, automated mechanism design, convergence and learning in games, complexity classes in game theory, algorithmic aspects of fixed-point theorems, mechanisms, incentives and coalitions, cost-sharing algorithms, computational problems in economics, finance, decision theory and pricing, computational social choice, auction algorithms, price of anarchy and its relatives, representations of games and their complexity, economic aspects of distributed computing and the internet, congestion, routing and network design and formation games and game-theoretic approaches to networking problems.