Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/5368| Title: | Location Games and Bounds for Median Problems |
| Issue Date: | 9-Oct-2013 |
| Publisher: | Massachusetts Institute of Technology, Operations Research Center |
| Description: | 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. |
| URI: | http://koha.mediu.edu.my:8181/xmlui/handle/1721 |
| Other Identifiers: | http://hdl.handle.net/1721.1/5368 |
| Appears in Collections: | MIT Items |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.