533 search results - page 37 / 107 » Playing games with approximation algorithms |
145
click to vote
AAAI
2007
15 years 5 months ago
2007
Weighted threshold games are coalitional games in which each player has a weight (intuitively corresponding to its voting power), and a coalition is successful if the sum of its w...
110
click to vote
MST
2010
15 years 1 months ago
2010
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 ...
114
click to vote
VTC
2010
IEEE
15 years 1 months ago
2010
IEEE
— In this paper, we look into the channel allocation problem for a non-cooperative cognitive vehicular ad-hoc communication network with multiple communicating pairs distributed ...
157
click to vote
INFOCOM
2010
IEEE
15 years 1 months ago
2010
IEEE
—In this paper we consider the problem of maximizing wireless network capacity (a.k.a. one-shot scheduling) in both the protocol and physical models. We give the first distribut...
120
click to vote
COCO
2005
Springer
15 years 8 months ago
2005
Springer
We study the complexity of solving succinct zero-sum games, i.e., the games whose payoff matrix M is given implicitly by a Boolean circuit C such that M(i, j) = C(i, j). We comple...