Sciweavers

163 search results - page 16 / 33
» Solving Simple Stochastic Games
Sort
View
ATAL
2010
Springer
13 years 8 months ago
Using counterfactual regret minimization to create competitive multiplayer poker agents
Games are used to evaluate and advance Multiagent and Artificial Intelligence techniques. Most of these games are deterministic with perfect information (e.g. Chess and Checkers)....
Nicholas Abou Risk, Duane Szafron
SIAMCO
2008
81views more  SIAMCO 2008»
13 years 7 months ago
Connections between Singular Control and Optimal Switching
This paper builds a new theoretical connection between singular control of finite variation and optimal switching problems. This correspondence provides a novel method for solving ...
Xin Guo, Pascal Tomecek
ATAL
2008
Springer
13 years 9 months ago
Searching for approximate equilibria in empirical games
When exploring a game over a large strategy space, it may not be feasible or cost-effective to evaluate the payoff of every relevant strategy profile. For example, determining a p...
Patrick R. Jordan, Yevgeniy Vorobeychik, Michael P...
AAAI
2007
13 years 10 months ago
Thresholded Rewards: Acting Optimally in Timed, Zero-Sum Games
In timed, zero-sum games, the goal is to maximize the probability of winning, which is not necessarily the same as maximizing our expected reward. We consider cumulative intermedi...
Colin McMillen, Manuela M. Veloso
ICASSP
2011
IEEE
12 years 11 months ago
Social norm and long-run learning in peer-to-peer networks
We start by formulating the resource sharing in peer-to-peer (P2P) networks as a random-matching gift-giving game, where self-interested peers aim at maximizing their own long-ter...
Yu Zhang, Mihaela van der Schaar