Fetching the paper…
Reading the bibliography…
This work studies the online contract design problem.
Moral hazard and observability
Bengt Holmström. 1979 · 1979
Earlier work this paper cites.
Moral hazard in teams
Bengt Holmstrom. 1982 · 1982
Earlier work this paper cites.
The first-order approach to principal-agent problems
William P Rogerson. 1985 · 1985
Earlier work this paper cites.
Justifying the first-order approach to principal-agent problems
Ian Jewitt. 1988 · 1988
Earlier work this paper cites.
Limited liability and incentive contracting with ex-ante action choices
Robert D Innes. 1990 · 1990
Earlier work this paper cites.
Multitask principal–agent analyses: Incentive contracts, asset ownership, and job design
Bengt Holmstrom and Paul Milgrom. 1991 · 1991
Earlier work this paper cites.
An analysis of the principal-agent problem
Sanford J Grossman and Oliver D Hart. 1992 · 1992
Earlier work this paper cites.
The theory of moral hazard and unobservable behaviour: Part I
James A Mirrlees. 1999 · 1999
Earlier work this paper cites.
A theory of sales quotas with limited liability and rent sharing
Paul Oyer. 2000 · 2000
Earlier work this paper cites.
The value of knowing a demand curve: Bounds on regret for online posted-price auctions. In 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings. IEEE, 594–605
Robert Kleinberg and Tom Leighton. 2003 · 2003
Cited alongside, same era.
Contract theory
Patrick Bolton and Mathias Dewatripont. 2004 · 2004
Cited alongside, same era.
Moral hazard with bounded payments
Ian Jewitt, Ohad Kadan, and Jeroen M Swinkels. 2008 · 2008
Cited alongside, same era.
Two new conditions supporting the first-order approach to multisignal principal–agent problems
John R Conlon. 2009 · 2009
Cited alongside, same era.
Bandits and Experts in Metric Spaces
Robert D. Kleinberg, Aleksandrs Slivkins, and Eli Upfal. 2013 · 2013
Cited alongside, same era.
Adaptive contract design for crowdsourcing markets: Bandit algorithms for repeated principal-agent problems. In Proceedings of the fifteenth ACM conference on Economics and computation . 359–376
Combinatorial contracts. In 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS) . IEEE, 815–826
Paul Dütting, Tomer Ezra, Michal Feldman, and Thomas Kesselheim. 2022 · 2021
Later among the works it cites.
The complexity of contracts
Paul Dütting, Tim Roughgarden, and Inbal Talgam-Cohen. 2021 · 2021
Later among the works it cites.
Multimodal dynamic pricing
Yining Wang, Boxiao Chen, and David Simchi-Levi. 2021 · 2021
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 · 2022
Later among the works it cites.
Are Bounded Contracts Learnable and Approximately Optimal?
Yurong Chen, Zhaohua Chen, Xiaotie Deng, and Zhiyi Huang. 2024 · 2024
Closest in time.
Repeated Contracting with Multiple Non-Myopic Agents: Policy Regret and Limited Liability
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Chien-Ju Ho, Aleksandrs Slivkins, and Jennifer Wortman Vaughan. 2014 · 2014
Cited alongside, same era.
Information space conditions for the first-order approach in agency problems
Jin Yong Jung and Son Ku Kim. 2015 · 2015
Cited alongside, same era.
Simple versus optimal contracts. In Proceedings of the 2019 ACM Conference on Economics and Computation . 369–387
Paul Dütting, Tim Roughgarden, and Inbal Talgam-Cohen. 2019 · 2019
Cited alongside, same era.
Adaptive Discretization for Adversarial Lipschitz Bandits. In Annual Conference Computational Learning Theory
Chara Podimata and Aleksandrs Slivkins. 2020 · 2020
Cited alongside, same era.
Multi-agent contracts. In Proceedings of the 55th Annual ACM Symposium on Theory of Computing . 1311–1324
Paul Dütting, Tomer Ezra, Michal Feldman, and Thomas Kesselheim. 2023a
Cited in the paper.
Optimal no-regret learning for one-sided lipschitz functions. In International Conference on Machine Learning . PMLR, 8836–8850
Paul Dütting, Guru Guruganesh, Jon Schneider, and Joshua Ruizhi Wang. 2023b
Cited in the paper.
Natalie Collina, Varun Gupta, and Aaron Roth. 2024 · 2024
Closest in time.
Algorithmic contract theory: A survey
Paul Dütting, Michal Feldman, Inbal Talgam-Cohen, et al · 2024
Closest in time.
Contracting with a learning agent
Guru Guruganesh, Yoav Kolumbus, Jon Schneider, Inbal Talgam-Cohen, Emmanouil-Vasileios Vlatakis-Gkaragkounis, Joshua R Wang, and S Matthew Weinberg. 2024 · 2024
Closest in time.