Sciweavers

450 search results - page 20 / 90
» Games with Exhaustible Resources
Sort
View
MST
2010
93views more  MST 2010»
13 years 6 months ago
Atomic Congestion Games: Fast, Myopic and Concurrent
We study here the effect of concurrent greedy moves of players in atomic congestion games where n selfish agents (players) wish to select a resource each (out of m resources) so ...
Dimitris Fotakis, Alexis C. Kaporis, Paul G. Spira...
BIRTHDAY
2009
Springer
14 years 2 months ago
Asynchronous Congestion Games
We introduce a new class of games, asynchronous congestion games (ACGs). In an ACG, each player has a task that can be carried out by any element of a set of resources, and each r...
Michal Penn, Maria Polukarov, Moshe Tennenholtz
ICC
2007
IEEE
102views Communications» more  ICC 2007»
14 years 2 months ago
M-gated Scheduling in Wireless Networks: Performance and Cross-layer Design
—E-limited (or K-limited) scheduling is attractive because its performance is close to that of the exhaustive scheduling which is proven to be the optimal polling scheme for symm...
Yan Li, Guangxi Zhu
AGI
2008
13 years 9 months ago
Adversarial Sequence Prediction
Sequence prediction is a key component of intelligence. This can be extended to define a game between intelligent agents. An analog of a result of Legg shows that this game is a co...
Bill Hibbard
IPPS
2007
IEEE
14 years 2 months ago
A Scalable Cluster Algorithm for Internet Resources
Applications such as parallel computing, online games, and content distribution networks need to run on a set of resources with particular network connection characteristics to ge...
Chuang Liu, Ian T. Foster