Sciweavers

45 search results - page 8 / 9
» On the Complexity of Equilibria Problems in Angel-Daemon Gam...
Sort
View
IPTPS
2004
Springer
14 years 24 days ago
Uncoordinated Load Balancing and Congestion Games in P2P Systems
In P2P systems, users often have many choices of peers from whom to download their data. Each user cares primarily about its own response time, which depends on how many other use...
Subhash Suri, Csaba D. Tóth, Yunhong Zhou
HICSS
2003
IEEE
123views Biometrics» more  HICSS 2003»
14 years 22 days ago
Issues in Rational Planning in Multi-Agent Settings
We adopt the decision-theoretic principle of expected utility maximization as a paradigm for designing autonomous rational agents operating in multi-agent environments. We use the...
Piotr J. Gmytrasiewicz
GAMESEC
2011
287views Game Theory» more  GAMESEC 2011»
12 years 7 months ago
Collaborative Location Privacy with Rational Users
Recent smartphones incorporate embedded GPS devices that enable users to obtain geographic information about their surroundings by providing a location-based service (LBS) with the...
Francisco Santos, Mathias Humbert, Reza Shokri, Je...
SIGECOM
2008
ACM
122views ECommerce» more  SIGECOM 2008»
13 years 7 months 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, ...
SIGECOM
2010
ACM
173views ECommerce» more  SIGECOM 2010»
13 years 7 months 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