Envy-free (EF) item allocation is a fair item allocation problem, in which the fairness criterion is envy-freeness - each agent should receive a bundle...

approximately-fair allocations; see envy-free item allocation. Finding partial envy-free allocations that are as large as possible; see envy-free matching. Using...

Fair item allocation is a kind of the fair division problem in which the items to divide are discrete rather than continuous. The items have to be divided...

amount of envy is as small as possible. Ideally, from a fairness perspective, one would like to find an envy-free item allocation - an allocation in which...

subject to envy-freeness. This problem is called the minimum-subsidy envy-free allocation. Unit-demand agents are interested in at most a single item. A special...

Envy-free pricing is a kind of fair item allocation. There is a single seller that owns some items, and a set of buyers who are interested in these items...

fair item allocation. It can be used to allocate several indivisible items among several people, such that the allocation is "almost" envy-free: each...

economics and social choice theory, an envy-free matching (EFM) is a matching between people to "things", which is envy-free in the sense that no person would...

Every envy-free item allocation is also proportional. The opposite implication is true when n=2, but not when n>2. Every proportional allocation satisfies...

the allocation is both Pareto-efficient and approximately fair. There are various notions of approximate fairness. An allocation is called envy-free (EF)...

envy-free item allocation. Given two parties and some discrete goods, it returns a partition of the goods between the two parties that is: Envy-free:...

be envy-free. Envy-free matching - some agents may remain unallocated, as long as they do not like any of the allocated houses. Fair item allocation -...

left unallocated (i.e., there is free disposal), but the allocation must be proportional (in addition to envy-free): each agent must get at least 1 /...

utilities over random allocations, i.e., lotteries over objects (Note that ex-ante envy-freeness is weaker than ex-post envy-freeness, but ex-ante Pareto-efficiency...

resource allocation, fair cake-cutting and fair item allocation. Group-envy-freeness is a very strong fairness requirement: a group-envy-free allocation is...

The envy-graph procedure (also called the envy-cycles procedure) is a procedure for fair item allocation. It can be used by several people who want to...

An envy-free cake-cutting is a kind of fair cake-cutting. It is a division of a heterogeneous resource ("cake") that satisfies the envy-free criterion...

gives a bound of: 9/8=1.125. For indivisible items, an assignment satisfying proportionality, envy-freeness, or equitability does not always exist (for...

Cloutier, Nyman and Su study two-player envy-free multi-cake division. For two cakes, they prove that an EF allocation may not exist when there are 2 agents...

Maximin share (MMS) is a criterion of fair item allocation. Given a set of items with different values, the 1-out-of-n maximin-share is the maximum value...

goal is to maximize the number of assignments subject to envy-freeness. Fair item allocation - each agent may get an arbitrary number of objects. Assignment...

constraints on the allocation. One may want to maximize the welfare among all allocations that are fair, for example, envy-free up to one item (EF1), proportional...

currency Controlled market Distributism Economic freedom Envy-free item allocation Fair cake-cutting Free market Informal sector Local exchange trading system...

Suksompong, Warut; Zick, Yair (2021-08-16). "Weighted Envy-freeness in Indivisible Item Allocation". ACM Transactions on Economics and Computation. 9 (3):...

Egalitarian item allocation, also called max-min item allocation is a fair item allocation problem, in which the fairness criterion follows the egalitarian...

Furthermore, by Varian's theorems, a CE allocation in which all agents have the same income is also envy-free. At the competitive equilibrium, the value...

round-robin item allocation can be used to find a 1/3-democratic 1-out-of-best-k allocation. In the context of rental harmony (envy-free division of rooms...

procedure is a procedure for fair item assignment between two people. It provably finds a complete envy-free item assignment whenever such assignment...

an item allocation problem with two items, which Alice values at {3, 2} and George values at {4, 1}. Consider the allocation giving the first item to...

for fair item assignment between two people. It finds an envy-free item assignment of a subset of the items. Moreover, the resulting allocation is Pareto...