Sciweavers

3061 search results - page 77 / 613
» Network Load Games
Sort
View
SAGT
2009
Springer
136views Game Theory» more  SAGT 2009»
14 years 4 months ago
Non-clairvoyant Scheduling Games
In a scheduling game, each player owns a job and chooses a machine to execute it. While the social cost is the maximal load over all machines (makespan), the cost (disutility) of ...
Christoph Dürr, Nguyen Kim Thang
ACMACE
2005
ACM
14 years 3 months ago
Gaming on the edge: using seams in ubicomp games
Outdoor multi-player games are an increasingly popular application area for ubiquitous computing, supporting experimentation both with new technologies and new user experiences. T...
Matthew Chalmers, Marek Bell, Barry Brown, Malcolm...
GLOBECOM
2008
IEEE
14 years 4 months ago
Cooperative and Non-Cooperative Aloha Games with Channel Capture
—Game theory has been a useful tool for the analysis of random-access based wireless networks due to their decentralized operations. This paper studies one of the most widely use...
Younggeun Cho, Fouad A. Tobagi
CORR
2011
Springer
212views Education» more  CORR 2011»
13 years 4 months ago
Path coalitional games
We present a general framework to model strategic aspects and stable and fair resource allocations in networks via variants and generalizations of path coalitional games. In these ...
Haris Aziz, Troels Bjerre Sørensen
CORR
2011
Springer
164views Education» more  CORR 2011»
13 years 1 months ago
Lipschitz Games
The Lipschitz constant of a finite normal–form game is the maximal change in some player’s payoff when a single opponent changes his strategy. We prove that games with small ...
Yaron Azrieli, Eran Shmaya