Sciweavers

17 search results - page 3 / 4
» Pseudonyms in Cost-Sharing Games
Sort
View
ALGORITHMICA
2010
154views more  ALGORITHMICA 2010»
13 years 6 months ago
On the Convergence of Multicast Games in Directed Networks
We investigate the convergence of the price of anarchy after a limited number of moves in the classical multicast communication game when the underlying communication networks is ...
Angelo Fanelli, Michele Flammini, Luca Moscardelli
ICALP
2011
Springer
12 years 9 months ago
Restoring Pure Equilibria to Weighted Congestion Games
Abstract. Congestion games model several interesting applications, including routing and network formation games, and also possess attractive theoretical properties, including the ...
Konstantinos Kollias, Tim Roughgarden
SAGT
2010
Springer
119views Game Theory» more  SAGT 2010»
13 years 4 months ago
Minimal Subsidies in Expense Sharing Games
A key solution concept in cooperative game theory is the core. The core of an expense sharing game contains stable allocations of the total cost to the participating players, such ...
Reshef Meir, Yoram Bachrach, Jeffrey S. Rosenschei...
SPAA
2006
ACM
14 years 6 days ago
Network design with weighted players
We consider a model of game-theoretic network design initially studied by Anshelevich et al. [2], where selfish players select paths in a network to minimize their cost, which is...
Ho-Lin Chen, Tim Roughgarden
PODC
2010
ACM
13 years 10 months ago
Bayesian ignorance
We quantify the effect of Bayesian ignorance by comparing the social cost obtained in a Bayesian game by agents with local views to the expected social cost of agents having glob...
Noga Alon, Yuval Emek, Michal Feldman, Moshe Tenne...