7 search results - page 1 / 2 » The Stackelberg Minimum Spanning Tree Game |
WINE
2009
Springer
13 years 11 months ago
2009
Springer
WADS
2007
Springer
13 years 11 months ago
2007
Springer
EOR
2008
13 years 5 months ago
2008
We introduce optimistic weighted Shapley rules in minimum cost spanning tree problems. We dene them as the weighted Shapley values of the optimistic game v+ introduced in Berganti
ACID
2006
13 years 6 months ago
2006
In a congestion game, several players simultaneously aim at allocating sets of resources, e.g., each player aims at allocating a shortest path between a source/destination pair in ...
GAMESEC
2010
13 years 2 months ago
2010
We study the strategic interaction between a network manager whose goal is to choose (as communication infrastructure) a spanning tree of a network given as an undirected graph, an...