Related papers: Capacity Constraints in Principal-Agent Problems
This paper addresses the problem of collaboratively satisfying long-term spatial constraints in multi-agent systems. Each agent is subject to spatial constraints, expressed as inequalities, which may depend on the positions of other agents…
We propose a pseudo-market solution to resource allocation problems subject to constraints. Our treatment of constraints is general: including bihierarchical constraints due to considerations of diversity in school choice, or scheduling in…
Selecting a set of alternatives based on the preferences of agents is an important problem in committee selection and beyond. Among the various criteria put forth for the desirability of a committee, Pareto optimality is a minimal and…
We study a generic principal-agent problem in continuous time on a finite time horizon. We introduce a framework in which the agent is allowed to employ measure-valued controls and characterise the continuation utility as a solution to a…
We consider a moral hazard problem with multiple principals in a continuous-time model. The agent can only work exclusively for one principal at a given time, so faces an optimal switching problem. Using a randomized formulation, we manage…
We present distributed algorithms that can be used by multiple agents to align their estimates with a particular value over a network with time-varying connectivity. Our framework is general in that this value can represent a consensus…
Traditional approaches to the design of multi-agent navigation algorithms consider the environment as a fixed constraint, despite the influence of spatial constraints on agents' performance. Yet hand-designing conducive environment layouts…
The many-to-one stable matching problem provides the fundamental abstraction of several real-world matching markets such as school choice and hospital-resident allocation. The agents on both sides are often referred to as residents and…
In the classical principal-agent hidden-action contract model, a principal delegates the execution of a costly task to an agent. In order to complete the task, the agent chooses an action from a set of actions, where each potential action…
In this paper we consider a principal agent problem where the agent is allowed to quit, by incurring a cost. When the current agent quits the job, the principal will hire a new one, possibly with a different type. We characterize the…
We consider a continuous time Principal-Agent model on a finite time horizon, where we look for the existence of an optimal contract both parties agreed on. Contrary to the main stream, where the principal is modelled as risk-neutral, we…
In this paper, we address three Principal--Agent problems in a moral hazard context and show that they are connected. We start by studying the problem of Principal with multiple Agents in cooperation. The term cooperation is manifested here…
In this paper, we study moral hazard problems in contract theory by adding an exogenous Planner to manage the actions of Agents hired by a Principal. We provide conditions ensuring that Pareto optima exist for the Agents using the…
Multi-agent systems (MAS) composed of large language models often exhibit improved problem-solving performance despite operating on identical information. In this work, we provide a formal explanation for this phenomenon grounded in…
We study hidden-action principal-agent problems with multiple agents. Unlike previous work, we consider a general setting in which each agent has an arbitrary number of actions, and the joint action induces outcomes according to an…
We introduce a new model of combinatorial contracts in which a principal delegates the execution of a costly task to an agent. To complete the task, the agent can take any subset of a given set of unobservable actions, each of which has an…
Regulatory and contractual constraints on individual exposures are standard in insurance and reinsurance markets, but a poorly designed constraint can distort the economic incentives of risk-averse agents. In the unconstrained problem, the…
We prove an existence result for the principal-agent problem with adverse selection under general assumptions on preferences and allocation spaces. Instead of assuming that the allocation space is finite-dimensional or compact, we consider…
We consider two kind of energy constraints when the output state is a coherent state. One is a constraint on the total energy during a fixed period; the other is a constraint on the total energy for a single code. The first setting can be…
We present an optimization framework that solves constrained multi-agent optimization problems while keeping each agent's state differentially private. The agents in the network seek to optimize a local objective function in the presence of…