中文
相关论文

相关论文: Fair Division of Indivisible Goods Among Strategic…

200 篇论文

In the allocation of resources to a set of agents, how do fairness guarantees impact the social welfare? A quantitative measure of this impact is the price of fairness, which measures the worst-case loss of social welfare due to fairness…

计算机科学与博弈论 · 计算机科学 2020-11-03 Siddharth Barman , Umang Bhaskar , Nisarg Shah

The classic fair division problems assume the resources to be allocated are either divisible or indivisible, or contain a mixture of both, but the agents always have a predetermined and uncontroversial agreement on the (in)divisibility of…

计算机科学与博弈论 · 计算机科学 2025-03-31 Xiaohui Bei , Shengxin Liu , Xinhang Lu

We consider the task of assigning indivisible goods to a set of agents in a fair manner. Our notion of fairness is Nash social welfare, i.e., the goal is to maximize the geometric mean of the utilities of the agents. Each good comes in…

数据结构与算法 · 计算机科学 2019-05-13 Bhaskar Chaudhury , Yun Kuen Cheung , Jugal Garg , Naveen Garg , Martin Hoefer , Kurt Mehlhorn

We study the problem of allocating indivisible goods among n agents in a fair manner. For this problem, maximin share (MMS) is a well-studied solution concept which provides a fairness threshold. Specifically, maximin share is defined as…

计算机科学与博弈论 · 计算机科学 2017-11-22 Siddharth Barman , Arpita Biswas , Sanath Kumar Krishnamurthy , Y. Narahari

Fair division of indivisible goods is a very well-studied problem. The goal of this problem is to distribute $m$ goods to $n$ agents in a "fair" manner, where every agent has a valuation for each subset of goods. We assume general…

计算机科学与博弈论 · 计算机科学 2020-02-25 Bhaskar Ray Chaudhury , Tellikepalli Kavitha , Kurt Mehlhorn , Alkmini Sgouritsa

Fair allocation of indivisible goods studies allocating $m$ goods among $n$ agents in a fair manner. While fairness is a fundamental requirement in many real-world applications, it often conflicts with (economic) efficiency. This raises a…

计算机科学与博弈论 · 计算机科学 2025-06-03 Xiaolin Bu , Zihao Li , Shengxin Liu , Jiaxin Song , Biaoshuai Tao

We study fair resource allocation when the resources contain a mixture of divisible and indivisible goods, focusing on the well-studied fairness notion of maximin share fairness (MMS). With only indivisible goods, a full MMS allocation may…

计算机科学与博弈论 · 计算机科学 2021-07-02 Xiaohui Bei , Shengxin Liu , Xinhang Lu , Hongao Wang

We study the problem of designing truthful and fair mechanisms when allocating a mixture of divisible and indivisible goods. We first show that there does not exist an EFM (envy-free for mixed goods) and truthful mechanism in general. This…

计算机科学与博弈论 · 计算机科学 2023-05-17 Zihao Li , Shengxin Liu , Xinhang Lu , Biaoshuai Tao

We study the problem of allocating indivisible goods among agents with additive valuation functions to achieve both fairness and efficiency under the constraint that each agent receives exactly the same number of goods (the \emph{balanced…

计算机科学与博弈论 · 计算机科学 2026-03-09 Yasushi Kawase , Ryoga Mahara

We consider the problem of fairly allocating indivisible goods, among agents, under cardinality constraints and additive valuations. In this setting, we are given a partition of the entire set of goods---i.e., the goods are…

计算机科学与博弈论 · 计算机科学 2020-10-20 Siddharth Barman , Arpita Biswas

We study the fair allocation of indivisible goods among agents with identical, additive valuations but individual budget constraints. Here, the indivisible goods--each with a specific size and value--need to be allocated such that the…

计算机科学与博弈论 · 计算机科学 2023-03-20 Siddharth Barman , Arindam Khan , Sudarshan Shyam , K. V. N. Sreenivas

We analyze the run-time complexity of computing allocations that are both fair and maximize the utilitarian social welfare, defined as the sum of agents' utilities. We focus on two tractable fairness concepts: envy-freeness up to one item…

计算机科学与博弈论 · 计算机科学 2024-09-23 Haris Aziz , Xin Huang , Nicholas Mattei , Erel Segal-Halevi

We study the problem of fair allocation of a set of indivisible items among agents with additive valuations, under matroid constraints and two generalizations: $p$-extendible system and independence system constraints. The objective is to…

计算机科学与博弈论 · 计算机科学 2024-11-07 Yuanyuan Wang , Xin Chen , Qingqin Nong

We study fair allocation of indivisible public goods subject to cardinality (budget) constraints. In this model, we have n agents and m available public goods, and we want to select $k \leq m$ goods in a fair and efficient manner. We first…

计算机科学与博弈论 · 计算机科学 2021-07-22 Jugal Garg , Pooja Kulkarni , Aniket Murhekar

We study the problem of allocating a set of indivisible goods among agents with subadditive valuations in a fair and efficient manner. Envy-Freeness up to any good (EFX) is the most compelling notion of fairness in the context of…

计算机科学与博弈论 · 计算机科学 2020-08-18 Bhaskar Ray Chaudhury , Jugal Garg , Ruta Mehta

One of the important yet insufficiently studied subjects in fair allocation is the externality effect among agents. For a resource allocation problem, externalities imply that a bundle allocated to an agent may affect the utilities of other…

计算机科学与博弈论 · 计算机科学 2018-05-17 Mohammad Ghodsi , Hamed Saleh , Masoud Seddighin

A major problem in fair division is how to allocate a set of indivisible resources among agents fairly and efficiently. The goal of this work is to characterize the tradeoffs between two well-studied measures of fairness and efficiency --…

计算机科学与博弈论 · 计算机科学 2024-01-17 Michal Feldman , Simon Mauras , Tomasz Ponitka

The Nash social welfare (NSW) is a well-known social welfare measurement that balances individual utilities and the overall efficiency. In the context of fair allocation of indivisible goods, it has been shown by Caragiannis et al. (EC 2016…

计算机科学与博弈论 · 计算机科学 2020-12-08 Xiaowei Wu , Bo Li , Jiarui Gan

Fairness and efficiency have become the pillars of modern fair division research, but prior work on achieving both simultaneously is largely limited to the unconstrained setting. We study fair and efficient allocations of indivisible goods…

计算机科学与博弈论 · 计算机科学 2024-11-04 Benjamin Cookson , Soroush Ebadian , Nisarg Shah

We study the problem of computing \emph{fair} divisions of a set of indivisible goods among agents with \emph{additive} valuations. For the past many decades, the literature has explored various notions of fairness, that can be primarily…

计算机科学与博弈论 · 计算机科学 2025-01-22 Hannaneh Akrami , Nidhi Rathi
‹ 上一页 1 2 3 10 下一页 ›