Sciweavers

163 search results - page 10 / 33
» Solving Simple Stochastic Games
Sort
View
ATAL
2010
Springer
14 years 11 months ago
Joint process games: from ratings to wikis
We introduce a game setting called a joint process, where the history of actions determine the state, and the state and agent properties determine the payoff. This setting is a sp...
Michael Munie, Yoav Shoham
AAAI
2008
15 years 14 days ago
Achieving Cooperation in a Minimally Constrained Environment
We describe a simple environment to study cooperation between two agents and a method of achieving cooperation in that environment. The environment consists of randomly generated ...
Steven Damer, Maria L. Gini
EVOW
2007
Springer
15 years 2 months ago
Evaluation of Different Metaheuristics Solving the RND Problem
RND (Radio Network Design) is a Telecommunication problem consisting in covering a certain geographical area by using the smallest number of radio antennas achieving the biggest co...
Miguel A. Vega-Rodríguez, Juan Antonio G&oa...
WINE
2007
Springer
124views Economy» more  WINE 2007»
15 years 4 months ago
Stochastic Models for Budget Optimization in Search-Based Advertising
Internet search companies sell advertisement slots based on users’ search queries via an auction. Advertisers have to solve a complex optimization problem of how to place bids o...
S. Muthukrishnan, Martin Pál, Zoya Svitkina
92
Voted
IJCAI
2001
14 years 11 months ago
R-MAX - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning
R-max is a very simple model-based reinforcement learning algorithm which can attain near-optimal average reward in polynomial time. In R-max, the agent always maintains a complet...
Ronen I. Brafman, Moshe Tennenholtz