Sciweavers

594 search results - page 67 / 119
» Games with Secure Equilibria
Sort
View
CDC
2009
IEEE
118views Control Systems» more  CDC 2009»
14 years 17 days ago
Nash equilibrium problems with congestion costs and shared constraints
Abstract— Generalized Nash equilibria (GNE) represent extensions of the Nash solution concept when agents have shared strategy sets. This generalization is particularly relevant ...
Huibing Yin, Uday V. Shanbhag, Prashant G. Mehta
AAAI
2000
13 years 9 months ago
Deliberation in Equilibrium: Bargaining in Computationally Complex Problems
We develop a normative theory of interaction-negotiation in particular--among self-interested computationally limited agents where computational actions are game-theoretically tre...
Kate Larson, Tuomas Sandholm
AAAI
2012
11 years 10 months ago
Generalized Sampling and Variance in Counterfactual Regret Minimization
In large extensive form games with imperfect information, Counterfactual Regret Minimization (CFR) is a popular, iterative algorithm for computing approximate Nash equilibria. Whi...
Richard G. Gibson, Marc Lanctot, Neil Burch, Duane...
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...
NOSSDAV
2005
Springer
14 years 1 months ago
Mitigating information exposure to cheaters in real-time strategy games
Cheating in on-line games is a prevalent problem for both game makers and players. The popular real-time strategy game genre is especially vulnerable to cheats, as it is frequentl...
Chris Chambers, Wu-chang Feng, Wu-chi Feng, Debanj...