dc.contributor.author | Haimovich, Mordecai | en_US |
dc.contributor.author | Magnanti, Thomas L. | en_US |
dc.date.accessioned | 2004-05-28T19:36:03Z | |
dc.date.available | 2004-05-28T19:36:03Z | |
dc.date.issued | 1985-01 | en_US |
dc.identifier.uri | http://hdl.handle.net/1721.1/5368 | |
dc.description.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. | en_US |
dc.format.extent | 1162655 bytes | |
dc.format.mimetype | application/pdf | |
dc.language.iso | en_US | en_US |
dc.publisher | Massachusetts Institute of Technology, Operations Research Center | en_US |
dc.relation.ispartofseries | Operations Research Center Working Paper;OR 133-85 | en_US |
dc.title | Location Games and Bounds for Median Problems | en_US |
dc.type | Working Paper | en_US |