Non-cooperative facility location and covering games
نویسندگان
چکیده
منابع مشابه
Non-cooperative Facility Location and Covering Games
We study a general class of non-cooperative games coming from combinatorial covering and facility location problems. A game for k players is based on an integer programming formulation. Each player wants to satisfy a subset of the constraints. Variables represent resources, which are available in costly integer units and must be bought. The cost can be shared arbitrarily between players. Once a...
متن کاملCooperative games in facility location situations with regional fixed costs
A continuous single-facility location problem, where the fixed cost (or installation cost) depends on the region where the new facility is located, is studied by mean of cooperative Game Theory tools. Core solutions are proposed for the total cost allocation problem. Sufficient conditions in order to have a nonempty core are given, then the Weber problem with regional fixed costs is studied.
متن کاملShapley Facility Location Games
Facility location games have been a topic of major interest in economics, operations research and computer science, starting from the seminal work by Hotelling. Spatial facility location models have successfully predicted the outcome of competition in a variety of scenarios. In a typical facility location game, users/customers/voters are mapped to a metric space representing their preferences, ...
متن کاملJogos Não Cooperativos de Localização de Instalações: uma Resenha Non-Cooperative Facility Location Games: a Survey
The Facility Location problem is a well-know NP-Hard combinatorial optimization problem. It models a diverse set of situations where one aims to provide a set of goods or services via a set of facilities F to a set of clients T , also called terminals. There are opening costs for each facility in F and connection costs for each pair of facility and client, if such facility attends this client. ...
متن کاملGeneral form of a cooperative gradual maximal covering location problem
Cooperative and gradual covering are two new methods for developing covering location models. In this paper, a cooperative maximal covering location–allocation model is developed (CMCLAP). In addition, both cooperative and gradual covering concepts are applied to the maximal covering location simultaneously (CGMCLP). Then, we develop an integrated form of a cooperative gradual maximal covering ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2010
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2010.02.005