Network design with weighted players (Q733733)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Network design with weighted players |
scientific article; zbMATH DE number 5617707
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Network design with weighted players |
scientific article; zbMATH DE number 5617707 |
Statements
Network design with weighted players (English)
0 references
19 October 2009
0 references
The paper contributes to the network design methods treated by means of tools of the algorithmic games. Selfish players select paths in a network, minimizing their costs which are specified in accordance with Shapley cost shares. For the game with identical players, the cost share incurred by a player for an edge is the fixed cost for each of them. The main results specify the approximation of Nash equilibria, analyze their properties and prove their existence.
0 references
algorithmic game theory
0 references
network design
0 references
price of stability
0 references
Shapley cost shares
0 references
cost shares
0 references
Nash equilibrium
0 references
0 references
0.8868807
0 references
0.8868807
0 references
0.8763255
0 references
0.8682423
0 references
0.86055374
0 references
0.85950434
0 references
0 references
