Related papers: Succinct Ambiguous Contracts
We describe new lower bounds for randomized communication complexity and query complexity which we call the partition bounds. They are expressed as the optimum value of linear programs. For communication complexity we show that the…
We study the role of regulatory inspections in a contract design problem in which a principal interacts separately with multiple agents. Each agent's hidden action includes a dimension that determines whether they undertake an extra costly…
In this paper, we discuss the ambiguous chance constrained based portfolio optimization problems, in which the perturbations associated with the input parameters are stochastic in nature, but their distributions are not known precisely. We…
We study the problem of maximizing a monotone submodular function subject to a cardinality constraint $k$, with the added twist that a number of items $\tau$ from the returned set may be removed. We focus on the worst-case setting…
Aaronson and Ambainis (SICOMP `18) showed that any partial function on $N$ bits that can be computed with an advantage $\delta$ over a random guess by making $q$ quantum queries, can also be computed classically with an advantage $\delta/2$…
In this article, we investigate the solvability of $k$-set agreement among $n$ processes in distributed systems prone to different types of process failures. Specifically, we explore two scenarios: synchronous message-passing systems prone…
We design new algorithms for the combinatorial pure exploration problem in the multi-arm bandit framework. In this problem, we are given $K$ distributions and a collection of subsets $\mathcal{V} \subset 2^{[K]}$ of these distributions, and…
We propose a new principal-agent framework where a principal communicates a roadmap -- a set of plausible outcome models and a prior belief over them -- to guide an agent who is learning the value of innovation. The agent trusts the prior…
This paper studies a robust utility maximization problem for intractable claims under distributional ambiguity, where the distribution of the claim cannot be inferred from market information and its dependence with tradable assets is…
We study buyer-optimal procurement mechanisms when quality is contractible. When some costs are borne by every participant of a procurement auction regardless of winning, the classic analysis should be amended. We show that an optimal…
Motivated by recent axiomatic developments, we study the risk- and ambiguity-averse investment problem where trading takes place over a fixed finite horizon and terminal payoffs are evaluated according to a criterion defined in terms of a…
I introduce novel preference formulations which capture aversion to ambiguity about unknown and potentially time-varying volatility. I compare these preferences with Gilboa and Schmeidler's maxmin expected utility as well as variational…
In this paper we formulate a contract design problem where a primary license holder wishes to profit from its excess spectrum capacity by selling it to potential secondary users/buyers. It needs to determine how to optimally price the…
Robust optimization is one of the fundamental approaches to deal with uncertainty in combinatorial optimization. This paper considers the robust spanning tree problem with interval data, which arises in a variety of telecommunication…
The existence of optimal contracts of the principal-agent problem is a long-standing problem. According to the general framework in Cvitani\'c et al. [2], this existence can be derived from the existence of a classical solution to a…
We study a principal-agent problem with adverse selection, where the principal does not know the agent's true cost but must design a contract to optimize a specific criterion. Unlike standard screening frameworks that allow for…
Classical complexity theory measures the cost of computing a function, but many computational tasks require committing to one valid output among several. We introduce determination depth -- the minimum number of sequential layers of…
We introduce the concept of strong high-order approximate minimizers for nonconvex optimization problems. These apply in both standard smooth and composite non-smooth settings, and additionally allow convex or inexpensive constraints. An…
This paper studies continuous-time optimal contracting in a hierarchy problem which generalises the model of Sung (2015). The hierarchy is modeled by a series of interlinked principal-agent problems, leading to a sequence of Stackelberg…
I analyze long-term contracting in insurance markets with asymmetric information. The buyer privately observes her risk type, which evolves stochastically over time. A long-term contract specifies a menu of insurance policies, contingent on…