Non-cooperative facility location and covering games (Q964406): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2010.02.005 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2073627465 / rank | |||
Normal rank | |||
Revision as of 00:49, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Non-cooperative facility location and covering games |
scientific article |
Statements
Non-cooperative facility location and covering games (English)
0 references
15 April 2010
0 references
The paper deals with a specific type of non-cooperative game model whose investigation is based on integer programming methods. The attention is focused on combinatorial and facility location problems. For this purpose, the concepts of the prices of anarchy and its counterpart, the stability, regarding the prices in the structure of the game, are analyzed. Their general properties, namely the estimations of their values and the computational complexity of their enumeration, represent the main results of the paper. Nash equilibrium is the game solution especially treated in the frame of the considered game model.
0 references
game
0 references
Nash equilibrium
0 references
cost sharing
0 references
price anarchy
0 references
approximate equilibrium
0 references
facility location
0 references
integer programming
0 references
computational time
0 references
games on graphs
0 references
