Sciweavers

128 search results - page 5 / 26
» Computing optimal strategies to commit to in extensive-form ...
Sort
View
CRYPTO
2000
Springer
149views Cryptology» more  CRYPTO 2000»
14 years 26 days ago
A Cryptographic Solution to a Game Theoretic Problem
In this work we use cryptography to solve a game-theoretic problem which arises naturally in the area of two party strategic games. The standard game-theoretic solution concept for...
Yevgeniy Dodis, Shai Halevi, Tal Rabin
JACM
2007
160views more  JACM 2007»
13 years 8 months ago
Lossless abstraction of imperfect information games
abstraction of imperfect information games ANDREW GILPIN and TUOMAS SANDHOLM Computer Science Department Carnegie Mellon University Pittsburgh, PA, USA Finding an equilibrium of an...
Andrew Gilpin, Tuomas Sandholm
ATAL
2005
Springer
14 years 2 months ago
The value of privacy: optimal strategies for privacy minded agents
Agents often want to protect private information, while at the same acting upon the information. These two desires are in conflict, and this conflict can be modeled in strategic...
Sieuwert van Otterloo
SIGECOM
2006
ACM
135views ECommerce» more  SIGECOM 2006»
14 years 2 months ago
Finding equilibria in large sequential games of imperfect information
Finding an equilibrium of an extensive form game of imperfect information is a fundamental problem in computational game theory, but current techniques do not scale to large games...
Andrew Gilpin, Tuomas Sandholm
GECCO
2003
Springer
133views Optimization» more  GECCO 2003»
14 years 1 months ago
Dynamic Strategies in a Real-Time Strategy Game
Abstract. Most modern real-time strategy computer games have a sophisticated but fixed ‘AI’ component that controls the computer’s actions. Once the user has learned how suc...
William Joseph Falke II, Peter Ross