Cargando…

Algorithmic Game Theory First International Symposium, SAGT 2008, Paderborn, Germany, April 30 - May 2, 2008, Proceedings /

This book constitutes the refereed proceedings of the First International Symposium on Algorithmic Game Theory, SAGT 2008, held in Paderborn, Germany, in April/May 2008. The 28 revised full papes presented together with 3 invited lectures were carefully reviewed and selected from 60 submissions. The...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor Corporativo: SpringerLink (Online service)
Otros Autores: Monien, Burkhard (Editor ), Schroeder, Ulf-Peter (Editor )
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2008.
Edición:1st ed. 2008.
Colección:Information Systems and Applications, incl. Internet/Web, and HCI ; 4997
Temas:
Acceso en línea:Texto Completo

MARC

LEADER 00000nam a22000005i 4500
001 978-3-540-79309-0
003 DE-He213
005 20220114183013.0
007 cr nn 008mamaa
008 100301s2008 gw | s |||| 0|eng d
020 |a 9783540793090  |9 978-3-540-79309-0 
024 7 |a 10.1007/978-3-540-79309-0  |2 doi 
050 4 |a QA76.76.A65 
072 7 |a UB  |2 bicssc 
072 7 |a COM032000  |2 bisacsh 
072 7 |a UX  |2 thema 
082 0 4 |a 005.3  |2 23 
245 1 0 |a Algorithmic Game Theory  |h [electronic resource] :  |b First International Symposium, SAGT 2008, Paderborn, Germany, April 30 - May 2, 2008, Proceedings /  |c edited by Burkhard Monien, Ulf-Peter Schroeder. 
250 |a 1st ed. 2008. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 2008. 
300 |a XI, 363 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Information Systems and Applications, incl. Internet/Web, and HCI ;  |v 4997 
505 0 |a Invited Talks -- The Search for Equilibrium Concepts -- Experimental Results on the Process of Goal Formation and Aspiration Adaptation -- Approximate Equilibria for Strategic Two Person Games -- Session 1: Routing and Scheduling I -- The Influence of Link Restrictions on (Random) Selfish Routing -- Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy -- The Price of Anarchy on Uniformly Related Machines Revisited -- Approximate Strong Equilibrium in Job Scheduling Games -- Session 2: Markets -- Bertrand Competition in Networks -- On the Approximability of Combinatorial Exchange Problems -- Window-Games between TCP Flows -- Price Variation in a Bipartite Exchange Network -- Session 3: Routing and Scheduling II -- Atomic Congestion Games: Fast, Myopic and Concurrent -- Frugal Routing on Wireless Ad-Hoc Networks -- Facets of the Fully Mixed Nash Equilibrium Conjecture -- Sensitivity of Wardrop Equilibria -- Session 4: Mechanism Design -- Prompt Mechanisms for Online Auctions -- A Truthful Mechanism for Offline Ad Slot Scheduling -- Alternatives to Truthfulness Are Hard to Recognize -- Distributed Algorithmic Mechanism Design and Algebraic Communication Complexity -- Session 5: Potpourri of Games -- The Price of Anarchy of a Network Creation Game with Exponential Payoff -- A Hierarchical Model for Cooperative Games -- Strategic Characterization of the Index of an Equilibrium -- The Local and Global Price of Anarchy of Graphical Games -- Session 6: Solution Concepts -- Approximate Nash Equilibria for Multi-player Games -- Subjective vs. Objective Reality - The Risk of Running Late -- On the Hardness and Existence of Quasi-Strict Equilibria -- The Price of Stochastic Anarchy -- Session 7: Cost Sharing -- Singleton Acyclic Mechanisms and Their Applications to Scheduling Problems -- Is Shapley Cost Sharing Optimal? -- Non-cooperative Cost Sharing Games Via Subsidies -- Group-Strategyproof Cost Sharing for Metric Fault Tolerant Facility Location -- Experimental Results on the Process of Goal Formation and Aspiration Adaptation. 
520 |a This book constitutes the refereed proceedings of the First International Symposium on Algorithmic Game Theory, SAGT 2008, held in Paderborn, Germany, in April/May 2008. The 28 revised full papes presented together with 3 invited lectures were carefully reviewed and selected from 60 submissions. The papers are organized in topical sections on routing and scheduling, markets, mechanism design, potpourri of games, solution concepts, and cost sharing. 
650 0 |a Application software. 
650 0 |a Computers and civilization. 
650 0 |a Information technology-Management. 
650 0 |a Electronic commerce. 
650 0 |a Information storage and retrieval systems. 
650 0 |a Computer science-Mathematics. 
650 0 |a Discrete mathematics. 
650 1 4 |a Computer and Information Systems Applications. 
650 2 4 |a Computers and Society. 
650 2 4 |a Computer Application in Administrative Data Processing. 
650 2 4 |a e-Commerce and e-Business. 
650 2 4 |a Information Storage and Retrieval. 
650 2 4 |a Discrete Mathematics in Computer Science. 
700 1 |a Monien, Burkhard.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Schroeder, Ulf-Peter.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9783540849926 
776 0 8 |i Printed edition:  |z 9783540793083 
830 0 |a Information Systems and Applications, incl. Internet/Web, and HCI ;  |v 4997 
856 4 0 |u https://doi.uam.elogim.com/10.1007/978-3-540-79309-0  |z Texto Completo 
912 |a ZDB-2-SCS 
912 |a ZDB-2-SXCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (SpringerNature-11645) 
950 |a Computer Science (R0) (SpringerNature-43710)