Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Finding fair and efficient allocations
We study the problem of allocating a set of indivisible goods among a set of agents in a fair
and efficient manner. An allocation is said to be fair if it is envy-free up to one good (EF1) …
and efficient manner. An allocation is said to be fair if it is envy-free up to one good (EF1) …
The combinatorial assignment problem: Approximate competitive equilibrium from equal incomes
This paper proposes a new mechanism for combinatorial assignment—for example,
assigning schedules of courses to students—based on an approximation to competitive …
assigning schedules of courses to students—based on an approximation to competitive …
[PDF][PDF] Fair Allocation of Indivisible Goods.
S Bouveret, Y Chevaleyre, N Maudet, H Moulin - 2016 - Citeseer
As introduced in Chapter 11 (Thomson, 2015), Fair Division refers to the general problem of
fairly dividing a common resource among agents having different—and sometimes …
fairly dividing a common resource among agents having different—and sometimes …
Characterizing conflicts in fair division of indivisible goods using a scale of criteria
We investigate five different fairness criteria in a simple model of fair resource allocation of
indivisible goods based on additive preferences. We show how these criteria are connected …
indivisible goods based on additive preferences. We show how these criteria are connected …
Course match: A large-scale implementation of approximate competitive equilibrium from equal incomes for combinatorial allocation
Combinatorial allocation involves assigning bundles of items to agents when the use of
money is not allowed. Course allocation is one common application of combinatorial …
money is not allowed. Course allocation is one common application of combinatorial …
Beyond dominant resource fairness: Extensions, limitations, and indivisibilities
We study the problem of allocating multiple resources to agents with heterogeneous
demands. Technological advances such as cloud computing and data centers provide a …
demands. Technological advances such as cloud computing and data centers provide a …
On approximate envy-freeness for indivisible chores and mixed resources
We study the fair allocation of undesirable indivisible items, or chores. While the case of
desirable indivisible items (or goods) is extensively studied, with many results known for …
desirable indivisible items (or goods) is extensively studied, with many results known for …
Fairness and decision-making in collaborative shift scheduling systems
The strains associated with shift work decrease healthcare workers' well-being. However,
shift schedules adapted to their individual needs can partially mitigate these problems. From …
shift schedules adapted to their individual needs can partially mitigate these problems. From …
Weighted fairness notions for indivisible items revisited
We revisit the setting of fairly allocating indivisible items when agents have different weights
representing their entitlements. First, we propose a parameterized family of relaxations for …
representing their entitlements. First, we propose a parameterized family of relaxations for …
Mechanism design for fair division: allocating divisible items without payments
We revisit the classic problem of fair division from a mechanism design perspective and
provide an elegant truthful mechanism that yields surprisingly good approximation …
provide an elegant truthful mechanism that yields surprisingly good approximation …