Multi-agent contracts
From MaRDI portal
Publication:6499304
DOI10.1145/3564246.3585193MaRDI QIDQ6499304
Thomas Kesselheim, Tomer Ezra, Paul Dütting, Michal Feldman
Publication date: 8 May 2024
Cites Work
- Unnamed Item
- Combinatorial agency
- Computing optimal contracts in combinatorial agencies
- Walrasian equilibrium with gross substitutes
- Contract design for afforestation programs
- Optimization with demand oracles
- Combinatorial auctions with decreasing marginal utilities
- Multi-parameter mechanism design and sequential posted pricing
- Prophet Inequalities Made Easy: Stochastic Optimization by Pricing Nonstochastic Inputs
- Mixed Strategies in Combinatorial Agency
- Free-Riding and Free-Labor in Combinatorial Agency
- An Analysis of the Principal-Agent Problem
- Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature
- Breaking the Logarithmic Barrier for Truthful Combinatorial Auctions with Submodular Bidders
- The Complexity of Contracts
- On Maximizing Welfare When Utility Functions Are Subadditive
- An n-to-1 Bidder Reduction for Multi-item Auctions and its Applications
- Combinatorial Auctions via Posted Prices
- Simultaneous auctions are (almost) efficient
- Composable and efficient mechanisms
- The Complexity of Contracts
- An $O(\log \log m)$ Prophet Inequality for Subadditive Combinatorial Auctions
- Bayesian Combinatorial Auctions
- Designing menus of contracts efficiently: the power of randomization
This page was built for publication: Multi-agent contracts
