Sciweavers

205 search results - page 24 / 41
» When Can Limited Randomness Be Used in Repeated Games
Sort
View
SODA
2010
ACM
208views Algorithms» more  SODA 2010»
15 years 10 months ago
Correlation Robust Stochastic Optimization
We consider a robust model proposed by Scarf, 1958, for stochastic optimization when only the marginal probabilities of (binary) random variables are given, and the correlation be...
Shipra Agrawal, Yichuan Ding, Amin Saberi, Yinyu Y...
91
Voted
AIMS
2008
Springer
15 years 7 months ago
Cooperation under Scarcity: The Sharer's Dilemma
Abstract. Many researchers have used game theory to study the problem of encouraging cooperation in peer-to-peer and mobile ad hoc networks, where resources are provided collective...
Michael Rogers, Saleem Bhatti
86
Voted
ENTCS
2006
144views more  ENTCS 2006»
15 years 21 days ago
Infinitary Howe's Method
Howe's method is a well-known technique for proving that various kinds of applicative bisimilarity (or similarity) on a functional language are congruences (or precongruences...
Paul Blain Levy
131
Voted
UAI
2008
15 years 2 months ago
Dyna-Style Planning with Linear Function Approximation and Prioritized Sweeping
We consider the problem of efficiently learning optimal control policies and value functions over large state spaces in an online setting in which estimates must be available afte...
Richard S. Sutton, Csaba Szepesvári, Alborz...
CI
2002
92views more  CI 2002»
15 years 15 days ago
Model Selection in an Information Economy: Choosing What to Learn
As online markets for the exchange of goods and services become more common, the study of markets composed at least in part of autonomous agents has taken on increasing importance...
Christopher H. Brooks, Robert S. Gazzale, Rajarshi...