Applications of approximation algorithms to cooperative games

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2001, Pages 364-372

  Jain, Kamal ^a   Vazirani, Vijay ^b  

^a Georgia Institute of Technology ^*  (United States)

^b Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; LINEAR PROGRAMMING; MULTICASTING; PACKET NETWORKS; ROUTERS;

MULTICAST ROUTING;

GAME THEORY;

EID: 0034825997     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/380752.380825     Document Type: Conference Paper

References (32)

1. On finding integer solutions to linear programs
2. On cost allocation for a spanning tree: A game theoretic approach
3. Some applications of linear programming to cooperative games
4. Multicast routing in datagram internetworks and extended lans
5. A concept of egalitarianism under participation constraints
6. Optimum branchings
7. On approximation fair cost allocation in euclidean tsp games
8. Sharing the cost of multicast transmission
9. A note on the traveling preacher problem
10. Cooperative facility location games
11. On minimum cost spanning tree games
12. On the core and nucleolus of minimum cost spanning tree games
13. Partial equilibirium approach to the free rider problem
14. Optimization problems in congestion control
15. On the core of the minimum Steiner tree game in networks
16. Population monotonic cost allocation on mst's
17. Distance monotonic stable cost allocation scheme for the minimum cost spanning tree network
18. A fast algorithm for Steiner trees
19. Worst-case equilibria
20. Fairness measures for resource allocation
21. Cost allocation for steiner trees
22. Incremental cost sharing: Characterization by coalition strategy-proofness
23. Strategyproof mechanism for cost sharing
24. Algorithms for selfish agents - Mechanism design for distributed computation
25. Algorithmic mechanism design
26. The characterization of implementable choice rules
27. How bad is selfish routing
28. On balanced sets and cores
29. A value of n-person games