24 citations · 57 across the 43 of their papers we have counts for
5 papers · 1 filter
Approximating Pandora's Knapsack via Simple Policies
Zohar Barak, Asnat Berlin, Ilan Reuven Cohen +3
We introduce Pandora's Knapsack: a hybrid between the classic stochastic knapsack problem [Dean et al., 2008] and Pandora's box [Weitzman, 1979]. As in stochastic knapsack, items h…
An Algorithm-to-Contract Framework without Demand Queries
Ilan Doron-Arad, Hadas Shachnai, Gilad Shmerler +1
Consider costly and time-consuming tasks that add up to the success of a project, and must be fitted into a given time-frame. This is an instance of the classic budgeted maximizati…
Multi-Project Contracts
Tal Alon, Matteo Castiglioni, Junjie Chen +3
We study a new class of contract design problems where a principal delegates the execution of multiple projects to a set of agents. The principal's expected reward from each projec…
Dynamic Rental Games with Stagewise Individual Rationality
Batya Berzack, Rotem Oshman, Inbal Talgam-Cohen
We study \emph{rental games} -- a single-parameter dynamic mechanism design problem, in which a designer rents out an indivisible asset over days. Each day, an agent arrives wi…
Welfare and Beyond in Multi-Agent Contracts
Gil Aharoni, Martin Hoefer, Inbal Talgam-Cohen
A principal delegates a project to a team from a pool of agents. The project's value if all agents in exert costly effort is . To incentivize the agents to partic…