 | 2009 |
| 36 |  | Benjamin Van Roy,
Xiang Yan:
Manipulation-resistant collaborative filtering systems.
RecSys 2009: 165-172 |
| 35 |  | Xiang Yan,
Benjamin Van Roy:
Manipulation Robustness of Collaborative Filtering Systems
CoRR abs/0903.0064: (2009) |
| 2008 |
| 34 |  | Xiang Yan,
Benjamin Van Roy:
Reputation markets.
NetEcon 2008: 79-84 |
| 33 |  | Haim H. Permuter,
Paul Cuff,
Benjamin Van Roy,
Tsachy Weissman:
Capacity of the Trapdoor Channel With Feedback.
IEEE Transactions on Information Theory 54(7): 3150-3165 (2008) |
| 2007 |
| 32 |  | Vivek F. Farias,
Ciamac Cyrus Moallemi,
Tsachy Weissman,
Benjamin Van Roy:
Universal Reinforcement Learning
CoRR abs/0707.3087: (2007) |
| 31 |  | Benjamin Van Roy:
A short proof of optimality for the MIN cache replacement algorithm.
Inf. Process. Lett. 102(2-3): 72-73 (2007) |
| 2006 |
| 30 |  | Ciamac Cyrus Moallemi,
Benjamin Van Roy:
Convergence of the Min-Sum Message Passing Algorithm for Quadratic Optimization
CoRR abs/cs/0603058: (2006) |
| 29 |  | Ciamac Cyrus Moallemi,
Benjamin Van Roy:
Consensus Propagation
CoRR abs/cs/0603078: (2006) |
| 28 |  | Haim H. Permuter,
Paul Cuff,
Benjamin Van Roy,
Tsachy Weissman:
Capacity of the Trapdoor Channel with Feedback
CoRR abs/cs/0610047: (2006) |
| 27 |  | David Choi,
Benjamin Van Roy:
A Generalized Kalman Filter for Fixed Point Approximation and Efficient Temporal-Difference Learning.
Discrete Event Dynamic Systems 16(2): 207-239 (2006) |
| 26 |  | Ciamac Cyrus Moallemi,
Benjamin Van Roy:
Consensus Propagation.
IEEE Transactions on Information Theory 52(11): 4753-4766 (2006) |
| 25 |  | Benjamin Van Roy:
Performance Loss Bounds for Approximate Value Iteration with State Aggregation.
Math. Oper. Res. 31(2): 234-244 (2006) |
| 24 |  | Daniela Pucci de Farias,
Benjamin Van Roy:
A Cost-Shaping Linear Program for Average-Cost Approximate Dynamic Programming with Performance Guarantees.
Math. Oper. Res. 31(3): 597-620 (2006) |
| 23 |  | Vivek F. Farias,
Benjamin Van Roy:
Approximation algorithms for dynamic resource allocation.
Oper. Res. Lett. 34(2): 180-190 (2006) |
| 22 |  | Paat Rusmevichientong,
Benjamin Van Roy,
Peter W. Glynn:
A Nonparametric Approach to Multiproduct Pricing.
Operations Research 54(1): 82-98 (2006) |
| 2005 |
| 21 |  | Ciamac Cyrus Moallemi,
Benjamin Van Roy:
Consensus Propagation.
NIPS 2005 |
| 20 |  | Gabriel Y. Weintraub,
C. Lanier Benkard,
Benjamin Van Roy:
Oblivious Equilibrium: A Mean Field Approximation for Large-Scale Dynamic Games.
NIPS 2005 |
| 19 |  | Benjamin Van Roy:
TD(0) Leads to Better Policies than Approximate Value Iteration.
NIPS 2005 |
| 2004 |
| 18 |  | Daniela Pucci de Farias,
Benjamin Van Roy:
A Cost-Shaping LP for Bellman Error Minimization with Performance Guarantees.
NIPS 2004 |
| 17 |  | Xiang Yan,
Persi Diaconis,
Paat Rusmevichientong,
Benjamin Van Roy:
Solitaire: Man Versus Machine.
NIPS 2004 |
| 16 |  | Hui Zhang,
Ashish Goel,
Ramesh Govindan,
Kahn Mason,
Benjamin Van Roy:
Making Eigenvector-Based Reputation Systems Robust to Collusion.
WAW 2004: 92-104 |
| 15 |  | Daniela Pucci de Farias,
Benjamin Van Roy:
On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming.
Math. Oper. Res. 29(3): 462-478 (2004) |
| 2003 |
| 14 |  | Ciamac Cyrus Moallemi,
Benjamin Van Roy:
Distributed Optimization in Adaptive Networks.
NIPS 2003 |
| 13 |  | Daniela Pucci de Farias,
Benjamin Van Roy:
The Linear Programming Approach to Approximate Dynamic Programming.
Operations Research 51(6): 850-865 (2003) |
| 2002 |
| 12 |  | Daniela Pucci de Farias,
Benjamin Van Roy:
Approximate Linear Programming for Average-Cost Dynamic Programming.
NIPS 2002: 1587-1594 |
| 11 |  | John N. Tsitsiklis,
Benjamin Van Roy:
On Average Versus Discounted Reward Temporal-Difference Learning.
Machine Learning 49(2-3): 179-191 (2002) |
| 2001 |
| 10 |  | David Choi,
Benjamin Van Roy:
A Generalized Kalman Filter for Fixed Point Approximation and Efficient Temporal Difference Learning.
ICML 2001: 43-50 |
| 9 |  | Daniela Pucci de Farias,
Benjamin Van Roy:
Approximate Dynamic Programming via Linear Programming.
NIPS 2001: 689-695 |
| 8 |  | Paat Rusmevichientong,
Benjamin Van Roy:
A Tractable POMDP for Dynamic Sequencing with Applications to Personalized Internet Content Provision.
UAI 2001: 480-487 |
| 7 |  | Paat Rusmevichientong,
Benjamin Van Roy:
An analysis of belief propagation on the turbo decoding graph with Gaussian densities.
IEEE Transactions on Information Theory 47(2): 745-765 (2001) |
| 2000 |
| 6 |  | Daniela Pucci de Farias,
Benjamin Van Roy:
Fixed Points of Approximate Value Iteration and Temporal-Difference Learning.
ICML 2000: 207-214 |
| 1999 |
| 5 |  | Paat Rusmevichientong,
Benjamin Van Roy:
An Analysis of Turbo Decoding with Gaussian Densities.
NIPS 1999: 575-581 |
| 1996 |
| 4 |  | John N. Tsitsiklis,
Benjamin Van Roy:
Analysis of Temporal-Diffference Learning with Function Approximation.
NIPS 1996: 1075-1081 |
| 3 |  | John N. Tsitsiklis,
Benjamin Van Roy:
Approximate Solutions to Optimal Stopping Problems.
NIPS 1996: 1082-1088 |
| 2 |  | John N. Tsitsiklis,
Benjamin Van Roy:
Feature-Based Methods for Large Scale Dynamic Programming.
Machine Learning 22(1-3): 59-94 (1996) |
| 1995 |
| 1 |  | Benjamin Van Roy,
John N. Tsitsiklis:
Stable LInear Approximations to Dynamic Programming for Stochastic Control Problems with Local Transitions.
NIPS 1995: 1045-1051 |