Sciweavers

1410 search results - page 132 / 282
» The Algorithmics of Solitaire-Like Games
Sort
View
CONCUR
2008
Springer
15 years 1 months ago
Strategy Construction for Parity Games with Imperfect Information
We consider imperfect-information parity games in which strategies rely on observations that provide imperfect information about the history of a play. To solve such games, i.e., t...
Dietmar Berwanger, Krishnendu Chatterjee, Laurent ...
AAAI
2010
15 years 1 months ago
Security Games with Arbitrary Schedules: A Branch and Price Approach
Security games, and important class of Stackelberg games, are used in deployed decision-support tools in use by LAX police and the Federal Air Marshals Service. The algorithms use...
Manish Jain, Erim Kardes, Christopher Kiekintveld,...
UAI
2000
15 years 27 days ago
Fast Planning in Stochastic Games
Stochastic games generalize Markov decision processes MDPs to a multiagent setting by allowing the state transitions to depend jointly on all player actions, and having rewards de...
Michael J. Kearns, Yishay Mansour, Satinder P. Sin...
CORR
2006
Springer
172views Education» more  CORR 2006»
14 years 11 months ago
Approximate Convex Optimization by Online Game Playing
This paper describes a general framework for converting online game playing algorithms into constrained convex optimization algorithms. This framework allows us to convert the wel...
Elad Hazan
FLAIRS
2010
15 years 1 months ago
Gamed-Based iSTART Practice: From MiBoard to Self-Explanation Showdown
MiBoard (Multiplayer Interactive Board Game) is an online, turnbased board game that was developed to assess the integration of game characteristics (point rewards, game-like inte...
Justin F. Brunelle