Online Contract Design
Elad Lavi, Hadas Shachnai, Inbal Talgam-Cohen

TL;DR
This paper introduces the concept of online contracts, combining game theory and online algorithms, and presents a competitive randomized algorithm for maximizing principal utility with additive agent rewards.
Contribution
It develops the first competitive online contract algorithm for additive rewards and introduces the novel technique of balance points for online contract analysis.
Findings
A 1/2-competitive randomized algorithm for additive rewards.
No deterministic algorithm can achieve a bounded competitive ratio.
Challenges arise with XOS reward structures, even for randomized algorithms.
Abstract
We initiate the study of online contracts, which integrate the game-theoretic considerations of economic contract theory, with the algorithmic and informational challenges of online algorithm design. Our starting point is the classic online setting with preemption of Buchbinder et al. [SODA'15], in which a hiring principal faces a sequence of adversarial agent arrivals. Upon arrival, the principal must decide whether to tentatively accept the agent to their team, and whether to dismiss previous tentative choices. Dismissal is irrevocable, giving the setting its online decision-making flavor. In our setting, the agents are rational players: once the team is finalized, a game is played where the principal offers contracts (performance-based payment schemes), and each agent decides whether or not to work. Working agents reward the principal, and the goal is to choose a team that maximizes…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAuction Theory and Applications · Optimization and Search Problems · Game Theory and Applications
