English
Related papers

Related papers: Individually Rational Land and Neighbor Allocation…

200 papers

We demonstrate that a ubiquitous feature of network games, bilateral strategic interactions, is equivalent to having player utilities that are additively separable across opponents. We distinguish two formal notions of bilateral strategic…

Theoretical Economics · Economics 2026-02-20 Joseph Root , Evan Sadler

We consider the division of a finite number of homogeneous divisible items among three players. Under the assumption that each player assigns a positive value to every item, we characterize the optimal allocations and we develop two exact…

Optimization and Control · Mathematics 2016-06-06 Marco Dall'Aglio , Camilla Di Luca , Lucia Milone

We study the fair division problem of allocating $m$ indivisible goods to $n$ agents with additive personalized bi-valued utilities. Specifically, each agent $i$ assigns one of two positive values $a_i > b_i > 0$ to each good, indicating…

Computer Science and Game Theory · Computer Science 2025-10-20 Jiarong Jin , Biaoshuai Tao

Drafts are sequential round-robin allocation procedures for distributing heterogeneous and indivisible objects among agents subject to some priority order (e.g., allocating players' contract rights to teams in professional sports leagues).…

Theoretical Economics · Economics 2026-04-09 Jacob Coreno , Ivan Balbuzanov

Hedonic games are an archetypal problem in coalition formation, where a set of selfish agents want to partition themselves into stable coalitions. In this work, we focus on two natural constraints on the possible outcomes. First, we require…

Computer Science and Game Theory · Computer Science 2026-03-24 Foivos Fioravantes , Harmender Gahlawat , Nikolaos Melissinos , Šimon Schierreich

In this work, we revisit the problem of fairly allocating a number of indivisible items that are located on a line to multiple agents. A feasible allocation requires that the allocated items to each agent are connected on the line. The…

Computer Science and Game Theory · Computer Science 2022-05-24 Ankang Sun , Bo Li

We study games with incomplete information and characterize when a feasible outcome is Pareto efficient. Outcomes with excessive randomization are inefficient: generically, the total number of action profiles across states must be strictly…

Theoretical Economics · Economics 2025-12-09 Itai Arieli , Yakov Babichenko , Atulya Jain , Rann Smorodinsky

I provide a unified framework to establish the existence of a weak Pareto efficient, envy-free allocation in general settings: random allocations are probability measures on a compact metric space, and preferences of agents are represented…

Theoretical Economics · Economics 2026-05-28 Anna Vakarova

Linear Logic and Defeasible Logic have been adopted to formalise different features relevant to agents: consumption of resources, and reasoning with exceptions. We propose a framework to combine sub-structural features, corresponding to the…

Artificial Intelligence · Computer Science 2018-09-12 Francesco Olivieri , Guido Governatori , Matteo Cristani , Nick van Beest , Silvano Colombo-Tosatto

We consider fair allocation of indivisible items under additive utilities. When the utilities can be negative, the existence and complexity of an allocation that satisfies Pareto optimality and proportionality up to one item (PROP1) is an…

Computer Science and Game Theory · Computer Science 2020-06-30 Haris Aziz , Herve Moulin , Fedor Sandomirskiy

We study a mechanism-design problem in which spiteful agents strive to not only maximize their rewards but also, contingent upon their own payoff levels, seek to lower the opponents' rewards. We characterize all individually rational (IR)…

Computer Science and Game Theory · Computer Science 2025-12-02 Aditya Aradhye , David Lagziel , Eilon Solan

We study resource allocation in two-sided markets from a fundamental perspective and introduce a general modeling and algorithmic framework to effectively incorporate the complex and multidimensional aspects of fairness. Our main technical…

Computer Science and Game Theory · Computer Science 2025-06-03 Javier Cembrano , Andrés Moraga , Victor Verdugo

In the standard model of fair allocation of resources to agents, every agent has some utility for every resource, and the goal is to assign resources to agents so that the agents' welfare is maximized. Motivated by job scheduling, interest…

Computer Science and Game Theory · Computer Science 2024-03-08 Susobhan Bandopadhyay , Aritra Banik , Sushmita Gupta , Pallavi Jain , Abhishek Sahu , Saket Saurabh , Prafullkumar Tale

We study a sequential decision-making model where a set of items is repeatedly matched to the same set of agents over multiple rounds. The objective is to determine a sequence of matchings that either maximizes the utility of the least…

Computer Science and Game Theory · Computer Science 2025-10-07 Eugene Lim , Tzeh Yuan Neoh , Nicholas Teh

In the problem of allocating a single non-disposable commodity among agents whose preferences are single-peaked, we study a weakening of strategy-proofness called not obvious manipulability (NOM). If agents are cognitively limited, then NOM…

Theoretical Economics · Economics 2024-04-25 R. Pablo Arribillaga , Agustin G. Bonifacio

Real estate prices have a significant impact on individuals, families, businesses, and governments. The general objective of real estate price prediction is to identify and exploit socioeconomic patterns arising from real estate…

Computers and Society · Computer Science 2022-10-13 Yaping Zhao , Ramgopal Ravi , Shuhui Shi , Zhongrui Wang , Edmund Y. Lam , Jichang Zhao

We study the problem of allocating indivisible objects to a set of rational agents where each agent's final utility depends on the intrinsic valuation of the allocated item as well as the allocation within the agent's local neighbourhood.…

Computer Science and Game Theory · Computer Science 2019-11-18 Sagar Massand , Sunil Simon

Several resource allocation problems involve multiple types of resources, with a different agency being responsible for "locally" allocating the resources of each type, while a central planner wishes to provide a guarantee on the properties…

Computer Science and Game Theory · Computer Science 2021-02-23 Sujoy Sikdar , Xiaoxi Guo , Haibin Wang , Lirong Xia , Yongzhi Cao

In social choice theory, anonymity (all agents being treated equally) and neutrality (all alternatives being treated equally) are widely regarded as ``minimal demands'' and ``uncontroversial'' axioms of equity and fairness. However, the ANR…

Computer Science and Game Theory · Computer Science 2023-07-14 Lirong Xia

We study sequential multi-issue trading between two greedily rational agents who exchange resources from a finite set of categories. Each agent's utility depends on its allocation, but the offering agent does not know the responding agent's…

Multiagent Systems · Computer Science 2026-05-15 Surya Murthy , Mustafa O. Karabag , Ufuk Topcu
‹ Prev 1 4 5 6 7 8 10 Next ›