Location Games and Bounds for Median Problems
Name
OR-133-85-.pdf
Size
1.11 MB
Format
Adobe PDF
Checksum (MD5)
509c81b98bc6342d23a87e41b58c6ddc
Author(s)
Haimovich, Mordecai
Magnanti, Thomas L.
Date Issued
January 1985
Publisher
Massachusetts Institute of Technology, Operations Research Center
Series/Report no.
Operations Research Center Working Paper;OR 133-85
Abstract
We consider a two-person zero-sum game in which the maximizer selects a point in a given bounded planar region, the minimizer selects K points in that region,.and the payoff is the distance from the maximizer's location to the minimizer's location closest to it. In a variant of this game, the maximizer has the privilege of restricting the game to any subset of the given region. We evaluate/approximate the values (and the saddle point strategies) of these games for K = 1 as well as for K + , thus obtaining tight upper bounds (and worst possible demand distributions) for K-median problems.
MIT Department
Massachusetts Institute of Technology. Operations Research Center
Persistent DSpace Link
