Sciweavers

119 search results - page 11 / 24
» The complexity of pure Nash equilibria
Sort
View
38
Voted
IJCAI
2003
15 years 1 months ago
Complexity Results about Nash Equilibria
Vincent Conitzer, Tuomas Sandholm
93
Voted
ISAAC
2005
Springer
153views Algorithms» more  ISAAC 2005»
15 years 5 months ago
Network Game with Attacker and Protector Entities
Consider an information network with harmful procedures called attackers (e.g., viruses); each attacker uses a probability distribution to choose a node of the network to damage. O...
Marios Mavronicolas, Vicky G. Papadopoulou, Anna P...
ACID
2006
298views Algorithms» more  ACID 2006»
15 years 1 months ago
Congestion Games: Optimization in Competition
In a congestion game, several players simultaneously aim at allocating sets of resources, e.g., each player aims at allocating a shortest path between a source/destination pair in ...
Berthold Vöcking
MOBIHOC
2012
ACM
13 years 2 months ago
Spatial spectrum access game: nash equilibria and distributed learning
A key feature of wireless communications is the spatial reuse. However, the spatial aspect is not yet well understood for the purpose of designing efficient spectrum sharing mecha...
Xu Chen, Jianwei Huang
FUIN
2008
128views more  FUIN 2008»
14 years 11 months ago
Impact of Asynchrony on the Behavior of Rational Selfish Agents
The behavior of rational selfish agents has been classically studied in the framework of strategic games in which each player has a set of possible actions, players choose actions ...
David Ilcinkas, Andrzej Pelc