Non-cooperative facility location and covering games (Q964406)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5693351
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Non-cooperative facility location and covering games |
scientific article; zbMATH DE number 5693351 |
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
0 references
0.9877057671546936
0 references
0.8565371632575989
0 references
0.8550111651420593
0 references
0.8537280559539795
0 references
0.8519797325134277
0 references
