Sciweavers

211 search results - page 2 / 43
» Solving Games Without Determinization
Sort
View
ATAL
2011
Springer
12 years 5 months ago
Solving Stackelberg games with uncertain observability
Recent applications of game theory in security domains use algorithms to solve a Stackelberg model, in which one player (the leader) first commits to a mixed strategy and then th...
Dmytro Korzhyk, Vincent Conitzer, Ronald Parr
ACG
2009
Springer
13 years 12 months ago
Solving Kriegspiel Endings with Brute Force: The Case of KR vs. K
Retrograde analysis is a tool for reconstructing a game tree starting from its leaves; with these techniques one can solve specific subsets of a complex game, achieving optimal pl...
Paolo Ciancarini, Gian Piero Favini
COCOON
2007
Springer
13 years 11 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...
GI
2009
Springer
13 years 3 months ago
The relation between protocols and games
: Both, games in a game theoretic sense and protocols in an informational sense describe rule based interactions between systems. Some similarities and differences of both approach...
Johannes Reich
SIGECOM
2005
ACM
97views ECommerce» more  SIGECOM 2005»
13 years 10 months ago
Complexity of (iterated) dominance
We study various computational aspects of solving games using dominance and iterated dominance. We first study both strict and weak dominance (not iterated), and show that checki...
Vincent Conitzer, Tuomas Sandholm