Sciweavers

AAAI
2006
13 years 6 months ago
Overconfidence or Paranoia? Search in Imperfect-Information Games
We derive a recursive formula for expected utility values in imperfect- information game trees, and an imperfectinformation game tree search algorithm based on it. The formula and...
Austin Parker, Dana S. Nau, V. S. Subrahmanian
STOC
1994
ACM
168views Algorithms» more  STOC 1994»
13 years 8 months ago
Fast algorithms for finding randomized strategies in game trees
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
Daphne Koller, Nimrod Megiddo, Bernhard von Stenge...
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...
SEFM
2007
IEEE
13 years 11 months ago
Verifying Security Properties of Cryptoprotocols: A Novel Approach
We model security protocols as a game tree using concepts of game semantics. Using this model we ascribe semantics to protocols written in the standard simple arrow notation. Acco...
Mohamed Saleh, Mourad Debbabi
IEEEIAS
2007
IEEE
13 years 11 months ago
Modeling Security Protocols as Games
We model security protocols as a game tree using concepts of game semantics. The model interprets protocol specifications as strategies over a game tree that represents the type ...
Mohamed Saleh, Mourad Debbabi