We study the combinatorial contracting problem of Dütting et al. [FOCS
'...
Maximizing monotone submodular functions under a matroid constraint is a...
In this work we initiate the study of buy-and-sell prophet inequalities....
We study the prophet secretary problem, a well-studied variant of the cl...
In this paper we initiate the study of ambiguous contracts, capturing ma...
We study a generalization of both the classic single-dimensional mechani...
Maximizing a submodular function is a fundamental task in machine learni...
First-price auctions have many desirable properties, including uniquely
...
Maximizing a monotone submodular function is a fundamental task in machi...
Economic theory distinguishes between principal-agent settings in which ...
We study single-sample prophet inequalities (SSPIs), i.e., prophet
inequ...
We consider the prophet inequality problem for (not necessarily bipartit...
The secretary problem is probably the purest model of decision making un...
The model of streaming algorithms is motivated by the increasingly commo...
Prophet inequalities compare the expected performance of an online algor...
Many important practical markets inherently involve the interaction of
s...
A central object in optimal stopping theory is the single-choice prophet...
We consider the classic principal-agent model of contract theory, in whi...
Designing an auction that maximizes expected revenue is an intricate tas...