Sciweavers

128 search results - page 3 / 26
» Computing optimal strategies to commit to in extensive-form ...
Sort
View
COCOON
2007
Springer
13 years 12 months ago
Finding Equilibria in Games of No Chance
Abstract. We consider finding maximin strategies and equilibria of explicitly given extensive form games with imperfect information but with no moves of chance. We show that a max...
Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, T...
P2P
2005
IEEE
13 years 11 months ago
Quantifying Agent Strategies under Reputation
Our research proposes a simple buyer/seller game that captures the incentives dictating the interaction between peers in resource trading peer-to-peer networks. We prove that for ...
Sergio Marti, Hector Garcia-Molina
NOSSDAV
2005
Springer
13 years 11 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...
AAAI
2008
13 years 8 months ago
Efficient Algorithms to Solve Bayesian Stackelberg Games for Security Applications
In a class of games known as Stackelberg games, one agent (the leader) must commit to a strategy that can be observed by the other agent (the adversary/follower) before the advers...
Praveen Paruchuri, Jonathan P. Pearce, Janusz Mare...
CONCUR
2006
Springer
13 years 9 months ago
Strategy Improvement for Stochastic Rabin and Streett Games
A stochastic graph game is played by two players on a game graph with probabilistic transitions. We consider stochastic graph games with -regular winning conditions specified as Ra...
Krishnendu Chatterjee, Thomas A. Henzinger