Applications of approximation algorithms to cooperative games
- 6 July 2001
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 364-372
- https://doi.org/10.1145/380752.380825
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Strategyproof Sharing of Submodular Access Costs: Budget Balance versus EfficiencySSRN Electronic Journal, 1996
- Multicast routing in datagram internetworks and extended LANsACM Transactions on Computer Systems, 1990
- A Concept of Egalitarianism Under Participation ConstraintsEconometrica, 1989
- On the core and nucleolus of minimum cost spanning tree gamesMathematical Programming, 1984
- Minimum cost spanning tree gamesMathematical Programming, 1981
- A fast algorithm for Steiner treesActa Informatica, 1981
- Cost allocation for steiner treesNetworks, 1978
- Partial equilibrium approach to the free-rider problemJournal of Public Economics, 1976
- On cost allocation for a spanning tree: A game theoretic approachNetworks, 1976
- On balanced sets and coresNaval Research Logistics Quarterly, 1967