33 citations · 39 across the 3 of their papers we have counts for
4 papers
Alternative Function Approximation Parameterizations for Solving Games: An Analysis of -Regression Counterfactual Regret Minimization
Ryan D'Orazio, Dustin Morrill, James R. Wright +1
Function approximation is a powerful approach for structuring large decision problems that has facilitated great achievements in the areas of reinforcement learning and game playin…
Bounds for Approximate Regret-Matching Algorithms
Ryan D'Orazio, Dustin Morrill, James R. Wright
A dominant approach to solving large imperfect-information games is Counterfactural Regret Minimization (CFR). In CFR, many regret minimization problems are combined to solve the g…
Learning in the Repeated Secretary Problem
Daniel G. Goldstein, R. Preston McAfee, Siddharth Suri +1
In the classical secretary problem, one attempts to find the maximum of an unknown and unlearnable distribution through sequential search. In many real-world searches, however, dis…
Incentivizing Evaluation via Limited Access to Ground Truth: Peer-Prediction Makes Things Worse
Alice Gao, James R. Wright, Kevin Leyton-Brown
In many settings, an effective way of evaluating objects of interest is to collect evaluations from dispersed individuals and to aggregate these evaluations together. Some examples…