-
Gradient Descent-Ascent Provably Converges to Strict Local Minmax Equilibria with a Finite Timescale Separation
We study the role that a finite timescale separation parameter τ has on ...
09/30/2020 ∙ by Tanner Fiez, et al. ∙
0
∙
share
read it
-
A SUPER* Algorithm to Optimize Paper Bidding in Peer Review
A number of applications involve sequential arrival of users, and requir...
06/27/2020 ∙ by Tanner Fiez, et al. ∙
0
∙
share
read it
-
Sequential Experimental Design for Transductive Linear Bandits
In this paper we introduce the transductive linear bandit problem: given...
06/20/2019 ∙ by Tanner Fiez, et al. ∙
0
∙
share
read it
-
Convergence of Learning Dynamics in Stackelberg Games
This paper investigates the convergence of learning dynamics in Stackelb...
06/04/2019 ∙ by Tanner Fiez, et al. ∙
0
∙
share
read it
-
Combinatorial Bandits for Incentivizing Agents with Dynamic Preferences
The design of personalized incentives or recommendations to improve user...
07/06/2018 ∙ by Tanner Fiez, et al. ∙
0
∙
share
read it
-
Adaptive Incentive Design
We apply control theoretic and optimization techniques to adaptively des...
06/14/2018 ∙ by Lillian J. Ratliff, et al. ∙
0
∙
share
read it
-
Incentives in the Dark: Multi-armed Bandits for Evolving Users with Unknown Type
Design of incentives or recommendations to users is becoming more common...
03/11/2018 ∙ by Lillian J. Ratliff, et al. ∙
0
∙
share
read it
-
Data-Driven Spatio-Temporal Analysis of Curbside Parking Demand: A Case-Study in Seattle
Due to rapid expansion of urban areas in recent years, management of cur...
12/02/2017 ∙ by Tanner Fiez, et al. ∙
0
∙
share
read it
