| Cooperative facility location games |
| Full text |
Pdf
(928 KB)
|
| Source
|
Symposium on Discrete Algorithms
archive
Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
table of contents
San Francisco, California, United States
Pages: 76 - 85
Year of Publication: 2000
ISBN:0-89871-453-2
|
|
Authors
|
|
Michel X. Goemans
|
Department of Mathematics, Room 2-351, M.I.T., Cambridge, MA and C.O.R.E., Louvain-la-Neuve, Belgium
|
|
Martin Skutella
|
TU Berlin, Fachbereich Mathematik, MA 6-1, Straβe des 17, Juni 136, 10623 Berlin, Germany and C.O.R.E., Louvain-la-Neuve, Belgium
|
|
| Sponsors |
|
| Publisher |
Society for Industrial and Applied Mathematics
Philadelphia, PA, USA
|
| Bibliometrics |
Downloads (6 Weeks): 4, Downloads (12 Months): 36, Citation Count: 13
|
|
|
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
M. L. Balinski. Integer programming: Methods, uses, computation. Management Science, 12:253- 313, 1965.
|
 |
2
|
Amotz Bar-Noy , Sudipto Guha , Joseph (Seffi) Naor , Baruch Schieber, Approximating the throughput of multiple machines under real-time scheduling, Proceedings of the thirty-first annual ACM symposium on Theory of computing, p.622-631, May 01-04, 1999, Atlanta, Georgia, United States
[doi> 10.1145/301250.301420]
|
| |
3
|
P. Chardaire. On the core of facility location games. Manuscript.
|
| |
4
|
|
| |
5
|
G. Cornu6jols, G. L. Nemhauser, and L. A. Wolsey. The uncapacitated facility location problem, in P. Mirchandani and R. Francis, editors, Discrete Location Theory, pages 119 - 17 I. John Wiley and Sons, Inc., New York, 1990.
|
| |
6
|
M. Gr0tschel, L. Lov~z, and A. Schrijver. Geometric Algorithms and Combinatorial Optimization, volume 2 of Algorithms and Combinatorics. Springer, Berlin, 1988.
|
| |
7
|
|
| |
8
|
A. Kolen. Solving covering problems and the uncapacitated plant location problem on trees. European Journal of Operational Research, 12:266- 278, 1983.
|
| |
9
|
J. Krarup and O. Bilde. Plant location, set covering and economic lot size: an O(mn)-algorithm for structured problems. In L. Collatz and W. Wetterling, editors, Numerische Methoden bei Optimierungsaufgaben - Band 3 (Optimierkng bei graphentheoretischen und ganzzahligen Problemen), volume 36 of International series of numerical mathematics, pages 155-180. Birkhaeuser Verlag, 1977.
|
| |
10
|
P. B. Mirchandani and P. L. Francis, editors. Discrete Location Theory. John Wiley & Sons, 1990.
|
| |
11
|
|
| |
12
|
H. Moulin. Cooperative Microeconomics: A Game-Theoretic Introduction. Princeton University Press, 1995.
|
| |
13
|
|
| |
14
|
A. Oudjit. Median Locations on Deterministic and Probabilistic Multidimensional Net;vorks. PhD thesis, Rensselaer Polytechnic Institute, Troy, New York, 1981.
|
| |
15
|
M. Padberg. Linear Optimization and Extensions. Springer, Berlin, 1995.
|
| |
16
|
A. Tamir. On the core of cost allocation games defined on location problems. Transportation Science, 27:81 - 86, 1992.
|
| |
17
|
|
CITED BY 13
|
|
|
|
Nikhil R. Devanur , Milena Mihail , Vijay V. Vazirani, Strategyproof cost-sharing mechanisms for set cover and facility location games, Proceedings of the 4th ACM conference on Electronic commerce, p.108-114, June 09-12, 2003, San Diego, CA, USA
|
|
|
|
|
R. C. Chakinala , A. Kumarasubramanian , K. A. Laing , R. Manokaran , C. Pandu Rangan , R. Rajaraman, Playing push vs pull: models and algorithms for disseminating dynamic data in networks, Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures, July 30-August 02, 2006, Cambridge, Massachusetts, USA
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Byung-Gon Chun , Kamalika Chaudhuri , Hoeteck Wee , Marco Barreno , Christos H. Papadimitriou , John Kubiatowicz, Selfish caching in distributed systems: a game-theoretic analysis, Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing, July 25-28, 2004, St. John's, Newfoundland, Canada
|
|
|
|
|
|
|
|
|
Peer to Peer - Readers of this Article have also read:
-
Data structures for quadtree approximation and compression
Communications of the ACM
28, 9
Hanan Samet
-
A hierarchical single-key-lock access control using the Chinese remainder theorem
Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing
Kim S. Lee
, Huizhu Lu
, D. D. Fisher
-
An intelligent component database for behavioral synthesis
Proceedings of the 27th ACM/IEEE conference on Design automation
Gwo-Dong Chen
, Daniel D. Gajski
-
The GemStone object database management system
Communications of the ACM
34, 10
Paul Butterworth
, Allen Otis
, Jacob Stein
-
Putting innovation to work: adoption strategies for multimedia communication systems
Communications of the ACM
34, 12
Ellen Francik
, Susan Ehrlich Rudman
, Donna Cooper
, Stephen Levine
|