175
click to vote
SIGECOM
15 years 10 months ago
2005 ACM
This paper concerns the design of mechanisms for online scheduling in which agents bid for access to a re-usable resource such as processor time or wireless network access. Each a...
128
click to vote
SIGECOM
15 years 10 months ago
2005 ACM
In this paper we formulate the fixed budget resource allocation game to understand the performance of a distributed marketbased resource allocation system. Multiple users decide ...
151
click to vote
SIGECOM
15 years 10 months ago
2005 ACM
We present a new approach to representing coalitional games based on rules that describe the marginal contributions of the agents. This representation scheme captures characterist...
157
click to vote
SIGECOM
15 years 10 months ago
2005 ACM
We introduce a new class of games, congestion games with failures (CGFs), which extends the class of congestion games to allow for facility failures. In a basic CGF (BCGF) agents ...
142
click to vote
SIGECOM
15 years 10 months ago
2005 ACM
In a previously reported user study, we found that users were able to perform decision tradeoff tasks more efficiently and commit considerably fewer errors with the example critiq...
|