000 05018nam a22006255i 4500
001 978-3-642-04645-2
003 DE-He213
005 20240423125916.0
007 cr nn 008mamaa
008 100301s2009 gw | s |||| 0|eng d
020 _a9783642046452
_9978-3-642-04645-2
024 7 _a10.1007/978-3-642-04645-2
_2doi
050 4 _aQA76.9.C65
072 7 _aUYM
_2bicssc
072 7 _aCOM072000
_2bisacsh
072 7 _aUYM
_2thema
082 0 4 _a003.3
_223
245 1 0 _aAlgorithmic Game Theory
_h[electronic resource] :
_bSecond International Symposium, SAGT 2009, Paphos, Cyprus, October 18-20, 2009, Proceedings /
_cedited by Marios Mavronicolas, Maria Papadoupoulou.
250 _a1st ed. 2009.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2009.
300 _aXI, 359 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v5814
505 0 _aMonotonicity 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.
520 _aThis 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.
650 0 _aComputer simulation.
650 0 _aApplication software.
650 0 _aComputers and civilization.
650 0 _aElectronic commerce.
650 0 _aComputer science.
650 0 _aNumerical analysis.
650 1 4 _aComputer Modelling.
650 2 4 _aComputer and Information Systems Applications.
650 2 4 _aComputers and Society.
650 2 4 _ae-Commerce and e-Business.
650 2 4 _aModels of Computation.
650 2 4 _aNumerical Analysis.
700 1 _aMavronicolas, Marios.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aPapadoupoulou, Maria.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783642046445
776 0 8 _iPrinted edition:
_z9783642046469
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v5814
856 4 0 _uhttps://doi.org/10.1007/978-3-642-04645-2
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c182983
_d182983