Network design with weighted players (Q733733): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 01:05, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Network design with weighted players |
scientific article |
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
