Fetching the paper…
Reading the bibliography…
We study a repeated contracting setting in which a Principal adaptively chooses amongst $k$ Agents at each of $T$ rounds.
A further generalization of the kakutani fixed point theorem, with applications to nash equilibrium points, 1951
I. L. Glicksberg · 1951
Earlier work this paper cites.
Moral hazard and observability
Bengt Holmström · 1979
Earlier work this paper cites.
An analysis of the principal-agent problem
Sanford J Grossman and Oliver D Hart · 1992
Earlier work this paper cites.
Contract theory
Patrick Bolton and Mathias Dewatripont · 2004
Earlier work this paper cites.
From external to internal regret
Avrim Blum and Yishay Mansour · 2007
Earlier work this paper cites.
Characterizing truthful multi-armed bandit mechanisms
Moshe Babaioff, Yogeshwer Sharma, and Aleksandrs Slivkins · 2009
Earlier work this paper cites.
Calibrated incentive contracts
Sylvain Chassang · 2013
Earlier work this paper cites.
Adaptive contract design for crowdsourcing markets: Bandit algorithms for repeated principal-agent problems
Chien-Ju Ho, Aleksandrs Slivkins, and Jennifer Wortman Vaughan · 2014
Cited alongside, same era.
Robustness and linear contracts
Gabriel Carroll · 2015
Cited alongside, same era.
Simple versus optimal contracts
Paul Dütting, Tim Roughgarden, and Inbal Talgam-Cohen · 2019
Cited alongside, same era.
Mechanisms for a no-regret agent: Beyond the common prior
Modibo K Camara, Jason D Hartline, and Aleck Johnsen · 2020
Cited alongside, same era.
Bayesian agency: Linear versus tractable contracts
Matteo Castiglioni, Alberto Marchesi, and Nicola Gatti · 2021
Cited alongside, same era.
Learning approximately optimal contracts
Alon Cohen, Argyrios Deligkas, and Moran Koren · 2022
Cited alongside, same era.
Combinatorial contracts
Paul Dütting, Tomer Ezra, Michal Feldman, and Thomas Kesselheim · 2022
Later among the works it cites.
Online minimax multiobjective optimization: Multicalibeating and other applications
Daniel Lee, Georgy Noarov, Mallesh Pai, and Aaron Roth · 2022
Later among the works it cites.
The sample complexity of online contract design
Banghua Zhu, Stephen Bates, Zhuoran Yang, Yixin Wang, Jiantao Jiao, and Michael I Jordan · 2022
Later among the works it cites.
Efficient prior-free mechanisms for no-regret agents
Natalie Collina, Aaron Roth, and Han Shao · 2023
Later among the works it cites.
From external to swap regret 2.0: An efficient reduction and oblivious adversary for large action spaces, 2023
Yuval Dagan, Constantinos Daskalakis, Maxwell Fishelson, and Noah Golowich · 2023
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Fast swap regret minimization and applications to approximate correlated equilibria
Binghui Peng and Aviad Rubinstein · 2023
Later among the works it cites.