English
Related papers

Related papers: Mechanisms without transfers for fully biased agen…

200 papers

In this paper, we consider a general distributed system with multiple agents who select and then implement actions in the system. The system has an operator with a centralized objective. The agents, on the other hand, are selfinterested and…

Computer Science and Game Theory · Computer Science 2020-01-15 Donya Ghavidel , Pratyush Chakraborty , Enrique Baeyens , Vijay Gupta , Pramod P. Khargonekar

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…

Probability · Mathematics 2022-09-14 Kaitong Hu , Zhenjie Ren , Junjian Yang

We consider an agent with a rationally inattentive preference over menus of acts, as in de Oliveira et al (2017). We show that two axioms, Independence of Irrelevant Alternatives and Ignorance Equivalence, are necessary and sufficient for…

Theoretical Economics · Economics 2026-02-18 Henrique de Oliveira , Jeffrey Mensch

The theory of two-sided matching has been extensively developed and applied to many real-life application domains. As the theory has been applied to increasingly diverse types of environments, researchers and practitioners have encountered…

Computer Science and Game Theory · Computer Science 2024-02-05 Sung-Ho Cho , Kei Kimura , Kiki Liu , Kwei-guu Liu , Zhengjie Liu , Zhaohong Sun , Kentaro Yahiro , Makoto Yokoo

A recent line of work in mechanism design has focused on guaranteeing incentive compatibility for agents without contingent reasoning skills: obviously strategyproof mechanisms guarantee that it is "obvious" for these imperfectly rational…

Computer Science and Game Theory · Computer Science 2023-12-14 Thomas Archbold , Bart de Keijzer , Carmine Ventre

Reallocating resources to get mutually beneficial outcomes is a fundamental problem in various multi-agent settings. While finding an arbitrary Pareto optimal allocation is generally easy, checking whether a particular allocation is Pareto…

Computer Science and Game Theory · Computer Science 2018-05-18 Haris Aziz , Peter Biro , Jerome Lang , Julien Lesca , Jerome Monnot

In fair division of indivisible goods, using sequences of sincere choices (or picking sequences) is a natural way to allocate the objects. The idea is as follows: at each stage, a designated agent picks one object among those that remain.…

Artificial Intelligence · Computer Science 2018-08-01 Aurélie Beynier , Sylvain Bouveret , Michel Lemaître , Nicolas Maudet , Simon Rey

When allocating indivisible objects via lottery, planners often use ordinal mechanisms, which elicit agents' rankings of objects rather than their full preferences over lotteries. In such an ordinal informational environment, planners…

Theoretical Economics · Economics 2025-08-21 Eun Jeong Heo , Vikram Manjunath , Samson Alva

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 explore the deliberate infusion of ambiguity into the design of contracts. We show that when the agent is ambiguity-averse and hence chooses an action that maximizes their minimum utility, the principal can strictly gain from using an…

Computer Science and Game Theory · Computer Science 2024-09-17 Paul Dütting , Michal Feldman , Daniel Peretz , Larry Samuelson

We design online algorithms for the fair allocation of public goods to a set of $N$ agents over a sequence of $T$ rounds and focus on improving their performance using predictions. In the basic model, a public good arrives in each round,…

Computer Science and Game Theory · Computer Science 2022-10-03 Siddhartha Banerjee , Vasilis Gkatzelis , Safwan Hossain , Billy Jin , Evi Micha , Nisarg Shah

The Probabilistic Serial mechanism is well-known for its desirable fairness and efficiency properties. It is one of the most prominent protocols for the random assignment problem. However, Probabilistic Serial is not incentive-compatible,…

Computer Science and Game Theory · Computer Science 2020-01-30 Zihe Wang , Zhide Wei , Jie Zhang

We study a decision-maker's problem of finding optimal monetary incentive schemes for retention when faced with agents whose participation decisions (stochastically) depend on the incentive they receive. Our focus is on policies constrained…

Computer Science and Game Theory · Computer Science 2024-07-31 Daniel Freund , Chamsi Hssaine

In standard fair division models, we assume that all agents are selfish. However, in many scenarios, division of resources has a direct impact on the whole group or even society. Therefore, we study fair allocations of indivisible items…

Computer Science and Game Theory · Computer Science 2025-11-13 Argyris Deligkas , Eduard Eiben , Tiger-Lily Goldsmith , Dušan Knop , Šimon Schierreich

We study a Bayesian persuasion problem with externalities. In this model, a principal sends signals to inform multiple agents about the state of the world. Simultaneously, due to the existence of externalities in the agents' utilities, the…

Artificial Intelligence · Computer Science 2024-12-18 Jonathan Shaki , Jiarui Gan , Sarit Kraus

We consider a general problem where an agent is in a multi-agent environment and must plan for herself without any prior information about her opponents. At each moment, this pivotal agent is faced with a trade-off between exploiting her…

Multiagent Systems · Computer Science 2025-02-14 Fengming Zhu , Fangzhen Lin

A privately-informed sender can commit to any disclosure policy towards a receiver. We show that full disclosure is optimal under a sufficient condition with some desirable properties. First, it speaks directly to the utility functions of…

Theoretical Economics · Economics 2023-02-15 Emiliano Catonini , Sergey Stepanov

We consider the classic principal-agent model of contract theory, in which a principal designs an outcome-dependent compensation scheme to incentivize an agent to take a costly and unobservable action. When all of the model…

Computer Science and Game Theory · Computer Science 2020-08-11 Paul Dütting , Tim Roughgarden , Inbal Talgam-Cohen

In this paper, we study axiomatic foundations of Bayesian persuasion, where a principal (i.e., sender) delegates the task of choice making after informing a biased agent (i.e., receiver) about the payoff relevant uncertain state (see, e.g.,…

Theoretical Economics · Economics 2025-12-30 Youichiro Higashi , Kemal Ozbek , Norio Takeoka

We study Bayesian automated mechanism design in unstructured dynamic environments, where a principal repeatedly interacts with an agent, and takes actions based on the strategic agent's report of the current state of the world. Both the…

Computer Science and Game Theory · Computer Science 2021-05-14 Hanrui Zhang , Vincent Conitzer