17 search results - page 4 / 4 » A computational characterization of multiagent games with fa... |
102
click to vote
SIGECOM
2005
ACM
15 years 3 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 ...
SIGECOM
2010
ACM
14 years 10 months ago
2010
ACM
In the traditional voting manipulation literature, it is assumed that a group of manipulators jointly misrepresent their preferences to get a certain candidate elected, while the ...