Work2001

Applications of approximation algorithms to cooperative games

211 citations0/0 files storedACM Symposium on Theory of Computing (STOC)

No readable copy stored yet — this record is metadata only.

Game Theory and Voting Systems Complexity and Algorithms in Graphs Game Theory and Applications

Abstract

The Internet, which is intrinsically a common playground for a large number of players with varying degrees of collab-orative and selsh motives, naturally gives rise to numerous new game theoretic issues. Computational problems under-

Citations in this library

Stored only when both papers are in the corpus — 211 citations exist upstream.

References

1999Worst-Case Equilibria 2001Algorithmic Mechanism Design 1952Contributions to the Theory of Games 1967On balanced sets and cores 1999Algorithmic mechanism design (extended abstract)1989A Concept of Egalitarianism Under Participation Constraints 1976On cost allocation for a spanning tree: A game theoretic approach 2002How bad is selfish routing?

Cited by

2004Group strategy proof mechanisms via primal-dual algorithms 2003Pricing WiFi at Starbucks 2008Network Design with Weighted Players 2003Nashification and the Coordination Ratio for a Selfish Routing Game 2010Designing Network Protocols for Good Equilibria 2003Strategyproof cost-sharing mechanisms for set cover and facility location games 2009On the Value of Coordination in Network Design 2007Distributed Algorithmic Mechanism Design

Imported from OpenAlex (CC0) — nothing here is generated.