Borrow it
Coverart for item
The Resource Algorithmic Game Theory : First International Symposium, Sagt 2008, Paderborn, Germany, April 30 - May 2, 2008, Proceedings, Burkhard Monien and Ulf-Peter Schroeder (eds.), (electronic resource)

Algorithmic Game Theory : First International Symposium, Sagt 2008, Paderborn, Germany, April 30 - May 2, 2008, Proceedings, Burkhard Monien and Ulf-Peter Schroeder (eds.), (electronic resource)

Creator
Contributor
Summary
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
Language
eng
Work
Publication
Extent
1 online resource (xi, 108 p.)
Contents
  • 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
Isbn
9783540793090
Instance
Label
Algorithmic Game Theory : First International Symposium, Sagt 2008, Paderborn, Germany, April 30 - May 2, 2008, Proceedings
Title
Algorithmic Game Theory
Title remainder
First International Symposium, Sagt 2008, Paderborn, Germany, April 30 - May 2, 2008, Proceedings
Statement of responsibility
Burkhard Monien and Ulf-Peter Schroeder (eds.)
Title variation
  • First International Symposium, Sagt 2008
  • 1st International Symposium, Sagt 2008
  • SAGT 2008
Creator
Contributor
Provider
Subject
Genre
Language
eng
Summary
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
Related
Member of
Cataloging source
GW5XE
Image bit depth
0
LC call number
QA269
LC item number
.S34 2008eb
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
2008
http://bibfra.me/vocab/lite/meetingName
SAGT (Symposium)
Nature of contents
dictionaries
http://library.link/vocab/relatedWorkOrContributorName
  • SpringerLink
  • Monien, B
  • Schroeder, Ulf-Peter
Series statement
Lecture Notes in Computer Science,
Series volume
4997
http://library.link/vocab/subjectName
  • Game theory
  • Algorithms
  • Algorithms
  • Game theory
  • Informatique
Label
Algorithmic Game Theory : First International Symposium, Sagt 2008, Paderborn, Germany, April 30 - May 2, 2008, Proceedings, Burkhard Monien and Ulf-Peter Schroeder (eds.), (electronic resource)
Instantiates
Publication
Antecedent source
mixed
Bibliography note
Includes bibliographical references and index
Color
not applicable
Contents
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
Dimensions
unknown
Extent
1 online resource (xi, 108 p.)
File format
multiple file formats
Form of item
  • online
  • electronic
Isbn
9783540793090
Level of compression
uncompressed
Other physical details
ill.
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
Stock number
978-3-540-79308-3
System control number
  • (OCoLC)233974093
  • (OCoLC)ocn233974093
Label
Algorithmic Game Theory : First International Symposium, Sagt 2008, Paderborn, Germany, April 30 - May 2, 2008, Proceedings, Burkhard Monien and Ulf-Peter Schroeder (eds.), (electronic resource)
Publication
Antecedent source
mixed
Bibliography note
Includes bibliographical references and index
Color
not applicable
Contents
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
Dimensions
unknown
Extent
1 online resource (xi, 108 p.)
File format
multiple file formats
Form of item
  • online
  • electronic
Isbn
9783540793090
Level of compression
uncompressed
Other physical details
ill.
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
Stock number
978-3-540-79308-3
System control number
  • (OCoLC)233974093
  • (OCoLC)ocn233974093

Subject

Genre

Member of

Related

Library Locations

  • African Studies LibraryBorrow it
    771 Commonwealth Avenue, 6th Floor, Boston, MA, 02215, US
    42.350723 -71.108227
  • Alumni Medical LibraryBorrow it
    72 East Concord Street, Boston, MA, 02118, US
    42.336388 -71.072393
  • Astronomy LibraryBorrow it
    725 Commonwealth Avenue, 6th Floor, Boston, MA, 02445, US
    42.350259 -71.105717
  • Fineman and Pappas Law LibrariesBorrow it
    765 Commonwealth Avenue, Boston, MA, 02215, US
    42.350979 -71.107023
  • Frederick S. Pardee Management LibraryBorrow it
    595 Commonwealth Avenue, Boston, MA, 02215, US
    42.349626 -71.099547
  • Howard Gotlieb Archival Research CenterBorrow it
    771 Commonwealth Avenue, 5th Floor, Boston, MA, 02215, US
    42.350723 -71.108227
  • Mugar Memorial LibraryBorrow it
    771 Commonwealth Avenue, Boston, MA, 02215, US
    42.350723 -71.108227
  • Music LibraryBorrow it
    771 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US
    42.350723 -71.108227
  • Pikering Educational Resources LibraryBorrow it
    2 Silber Way, Boston, MA, 02215, US
    42.349804 -71.101425
  • School of Theology LibraryBorrow it
    745 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US
    42.350494 -71.107235
  • Science & Engineering LibraryBorrow it
    38 Cummington Mall, Boston, MA, 02215, US
    42.348472 -71.102257
  • Stone Science LibraryBorrow it
    675 Commonwealth Avenue, Boston, MA, 02445, US
    42.350103 -71.103784

Library Links

Zepheira Logo
Structured data from the Bibframe namespace is licensed under the Creative Commons Attribution 4.0 International License by Boston University Libraries. Additional terms may apply to data associated with third party namespaces.
Processing Feedback ...