Sciweavers

129 search results - page 13 / 26
» Games, geometry, and the computational complexity of finding...
Sort
View
112
Voted
ITA
2002
163views Communications» more  ITA 2002»
15 years 3 days ago
Permissive strategies: from parity games to safety games
It is proposed to compare strategies in a parity game by comparing the sets of behaviours they allow. For such a game, there may be no winning strategy that encompasses all the be...
Julien Bernet, David Janin, Igor Walukiewicz
123
Voted
CORR
2010
Springer
155views Education» more  CORR 2010»
14 years 7 months ago
A Complexity View of Markets with Social Influence
: In this paper, inspired by the work of Megiddo on the formation of preferences and strategic analysis, we consider an early market model studied in the field of economic theory, ...
Xi Chen, Shang-Hua Teng
104
Voted
SIGECOM
2010
ACM
173views ECommerce» more  SIGECOM 2010»
15 years 19 days ago
Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
Anand Bhalgat, Tanmoy Chakraborty, Sanjeev Khanna
100
Voted
SIGECOM
2008
ACM
122views ECommerce» more  SIGECOM 2008»
15 years 11 days ago
On the windfall of friendship: inoculation strategies on social networks
This paper studies a virus inoculation game on social networks. A framework is presented which allows the measuring of the windfall of friendship, i.e., how much players benefit i...
Dominic Meier, Yvonne Anne Oswald, Stefan Schmid, ...
113
Voted
ATAL
2010
Springer
15 years 1 months ago
Stackelberg vs. Nash in security games: interchangeability, equivalence, and uniqueness
There has been significant recent interest in game theoretic approaches to security, with much of the recent research focused on utilizing the leader-follower Stackelberg game mod...
Zhengyu Yin, Dmytro Korzhyk, Christopher Kiekintve...