English
Related papers

Related papers: Distributionally Robust Optimal Allocation with Co…

200 papers

We introduce a model of probabilistic verification in mechanism design. The principal elicits a message from the agent and then selects a test to give the agent. The agent's true type determines the probability with which he can pass each…

Theoretical Economics · Economics 2025-01-16 Ian Ball , Deniz Kattwinkel

A principal must allocate a set of heterogeneous tasks (or objects) among multiple agents. The principal has preferences over the allocation. Each agent has preferences over which tasks they are assigned, which are their private…

Theoretical Economics · Economics 2026-01-29 Quitzé Valenzuela-Stookey

The assignment problem is one of the most well-studied settings in social choice, matching, and discrete allocation. We consider the problem with the additional feature that agents' preferences involve uncertainty. The setting with…

Computer Science and Game Theory · Computer Science 2016-10-11 Haris Aziz , Ronald de Haan , Baharak Rastegari

We study allocation problems without monetary transfers where agents have correlated types, i.e., hold private information about one another. Such peer information is relevant in various settings, including science funding, allocation of…

Theoretical Economics · Economics 2025-03-21 Axel Niemeyer , Justus Preusser

A principal uses payments conditioned on stochastic outcomes of a team project to elicit costly effort from the team members. We develop a multi-agent generalization of a classic first-order approach to contract optimization by leveraging…

Theoretical Economics · Economics 2026-03-13 Krishna Dasaratha , Benjamin Golub , Anant Shah

We study the fair allocation of indivisible resources among agents. Most prior work focuses on fairness and/or efficiency among agents. However, the allocator, as the resource owner, may also be involved in many scenarios (e.g., government…

Computer Science and Game Theory · Computer Science 2025-06-10 Xiaolin Bu , Zihao Li , Shengxin Liu , Jiaxin Song , Biaoshuai Tao

We study the problem of allocating $m$ indivisible items to $n$ agents with additive utilities. It is desirable for the allocation to be both fair and efficient, which we formalize through the notions of envy-freeness and Pareto-optimality.…

Computer Science and Game Theory · Computer Science 2024-05-08 Yushi Bai , Paul Gölz

We study the assignment problem of objects to agents with heterogeneous preferences under distributional constraints. Each agent is associated with a publicly known type and has a private ordinal ranking over objects. We are interested in…

Data Structures and Algorithms · Computer Science 2019-05-02 Itai Ashlagi , Amin Saberi , Ali Shameli

We study the design of optimal allocation mechanisms in an environment where agents and goods arrive stochastically. Agents have private types that determine the principal payoff. Either agents or goods can be held in a queue at a flow cost…

Theoretical Economics · Economics 2026-02-05 Zihao Li , Xuandong Chen

Mechanism design is addressed in the context of fair allocations of indivisible goods with monetary compensation. Motivated by a real-world social choice problem, mechanisms with verification are considered in a setting where (i) agents'…

Computer Science and Game Theory · Computer Science 2012-09-18 Gianluigi Greco , Francesco Scarcello

We consider the problem of allocating heterogeneous and indivisible goods among strategic agents, with preferences over subsets of goods, when there is no medium of exchange. This model captures the well studied problem of fair allocation…

Computer Science and Game Theory · Computer Science 2026-04-27 Moshe Babaioff , Noam Manaker Morag

We design a mechanism for Fair and Efficient Distribution of Resources (FEDoR) in the presence of strategic agents. We consider a multiple-instances, Bayesian setting, where in each round the preference of an agent over the set of resources…

Computer Science and Game Theory · Computer Science 2016-09-28 Evgenia Christoforou , Antonio Fernández Anta , Agustín Santos

Strategic learning studies how decision rules interact with agents who may strategically change their inputs/features to achieve better outcomes. In standard settings, models assume that the decision-maker's sole scope is to learn a…

Computer Science and Game Theory · Computer Science 2025-10-23 Valia Efthymiou , Ekaterina Fedorova , Chara Podimata

We study a problem where a group of agents has to decide how some fixed value should be shared among them. We are interested in settings where the share that each agent receives is based on how that agent is evaluated by other members of…

Computer Science and Game Theory · Computer Science 2013-06-04 Arthur Carvalho , Kate Larson

We study the problem of fairly and efficiently allocating a set of items among strategic agents with additive valuations, where items are either all indivisible or all divisible. When items are goods, numerous positive and negative results…

Computer Science and Game Theory · Computer Science 2025-07-08 Bo Li , Biaoshuai Tao , Fangxiao Wang , Xiaowei Wu , Mingwei Yang , Shengwei Zhou

We study the problem of allocating indivisible goods among strategic agents. We focus on settings wherein monetary transfers are not available and each agent's private valuation is a submodular function with binary marginals, i.e., the…

Computer Science and Game Theory · Computer Science 2021-09-14 Siddharth Barman , Paritosh Verma

Models of economic decision makers often include idealized assumptions, such as rationality, perfect foresight, and access to all relevant pieces of information. These assumptions often assure the models' internal validity, but, at the same…

General Economics · Economics 2021-07-09 Patrick Reinwald , Stephan Leitner , Friederike Wall

We investigate the tradeoffs between fairness and efficiency when allocating indivisible items over time. Suppose T items arrive over time and must be allocated upon arrival, immediately and irrevocably, to one of n agents. Agent i assigns…

Computer Science and Game Theory · Computer Science 2020-05-18 David Zeng , Alexandros Psomas

We study the fundamental problem of allocating indivisible goods to agents with additive preferences. We consider eliciting from each agent only a ranking of her $k$ most preferred goods instead of her full cardinal valuations. We…

Computer Science and Game Theory · Computer Science 2021-05-25 Daniel Halpern , Nisarg Shah

We consider the problem of Adverse Selection and optimal derivative design within a Principal-Agent framework. The principal's income is exposed to non-hedgeable risk factors arising, for instance, from weather or climate phenomena. She…

Computational Engineering, Finance, and Science · Computer Science 2007-10-31 U. Horst , S. Moreno