Combinatorial Contract Design: Recent Progress and Emerging Frontiers

Mathematical techniques for efficient record segmentation in large shared databases

Mark J Eisner and Dennis G Severance · 1976

Earlier work this paper cites.

Moral hazard and observability

Bengt Holmström · 1979

Earlier work this paper cites.

Sensitivity analysis for combinatorial optimization

Daniel Mier Gusfield · 1980

Earlier work this paper cites.

Moral hazard in teams

Bengt Holmström · 1982

Earlier work this paper cites.

Job matching, coalition formation, and gross substitutes

Alexander S Kelso and Vincent P Crawford · 1982

Earlier work this paper cites.

An analysis of the principal-agent problem

Sanford J. Grossman and Oliver D. Hart · 1983

Earlier work this paper cites.

Convergence of Stochastic Processes

David Pollard · 1984

Earlier work this paper cites.

Aggregation and linearity in the provision of intertemporal incentives

Bengt Holmström and Paul Milgrom · 1987

Earlier work this paper cites.

Regulating trade among agents

Bengt Holmström and Paul Milgrom · 1990

Earlier work this paper cites.

Multitask principal-agent analyses: Incentive contracts, asset ownership, and job design

Bengt Holmström and Paul Milgrom · 1991

Earlier work this paper cites.

Incentives to help in multi-agent situations

Hideshi Itoh · 1991

Earlier work this paper cites.

Efficiency in partnerships

Patrick Legros and Hitoshi Matsushima · 1991

Earlier work this paper cites.

Well-layered maps-a class of greedily optimizable set functions

Andreas WM Dress and Werner Terhalle · 1995

Earlier work this paper cites.

Clique is hard to approximate within n 1-ε

J. Hastad · 1996

Earlier work this paper cites.

A threshold of ln n for approximating set cover

Uriel Feige · 1998

Earlier work this paper cites.

Walrasian equilibrium with gross substitutes

Faruk Gul and Ennio Stacchetti · 1999

Earlier work this paper cites.

The theory of moral hazard and unobservable behaviour: Part I

James A. Mirrlees · 1999

Earlier work this paper cites.

Combinatorial auctions with decreasing marginal utilities

Benny Lehmann, Daniel Lehmann, and Noam Nisan · 2001

Earlier work this paper cites.

Combinatorial agency

Moshe Babaioff, Michal Feldman, and Noam Nisan · 2006

Earlier work this paper cites.

Mixed strategies in combinatorial agency

Moshe Babaioff, Michal Feldman, and Noam Nisan · 2006

Earlier work this paper cites.

Combinatorial auctions

Liad Blumrosen and Noam Nisan · 2006

Earlier work this paper cites.

The communication requirements of efficient allocations and supporting prices

Noam Nisan and Ilya Segal · 2006

Earlier work this paper cites.

Linear degree extractors and the inapproximability of max clique and chromatic number

David Zuckerman · 2006

Earlier work this paper cites.

A strongly polynomial algorithm for line search in submodular polyhedra

Kiyohito Nagano · 2007

Earlier work this paper cites.

Combinatorial auctions

Noam Nisan · 2007

Cited alongside, same era.

On the computational power of demand queries

Liad Blumrosen and Noam Nisan · 2009

Cited alongside, same era.

combinatorial strongly polynomial algorithm for minimizing submodular functions

Satoru Iwata, Lisa Fleischer, and Satoru Fujishige · 2009

Cited alongside, same era.

Combinatorial agency

Moshe Babaioff, Michal Feldman, Noam Nisan, and Eyal Winter · 2012

Cited alongside, same era.

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.

Optimum statistical estimation with strategic data sources

Yang Cai, Constantinos Daskalakis, and Christos H. Papadimitriou · 2015

Cited alongside, same era.

Multi-agent contract design: How to commission multiple agents with individual outcome

Matteo Castiglioni, Alberto Marchesi, and Nicola Gatti · 2023

Later among the works it cites.

Multi-agent contracts

Paul Dütting, Tomer Ezra, Michal Feldman, and Thomas Kesselheim · 2023

Later among the works it cites.

Ambiguous contracts

Paul Dütting, Michal Feldman, Daniel Peretz, and Larry Samuelson · 2023

Later among the works it cites.

Estimating effects of incentive contracts in online labor platforms

Nur Kaynar and Auyon Siddiq · 2023

Later among the works it cites.

Deep contract design via discontinuous networks

Tonghan Wang, Paul Dütting, Dmitry Ivanov, Inbal Talgam-Cohen, and David C. Parkes · 2023

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 · 2023

Later among the works it cites.