the resources among the agents in a way that is both Pareto efficient (PE) and envy-free (EF). The goal was first defined by David Schmeidler and Menahem...

Envy-freeness, also known as no-envy, is a criterion for fair division. It says that, when resources are allocated among people with equal rights, each...

challenge is to satisfy it in conjunction with fairness. See Efficient envy-free division. A stronger notion is utilitarian-maximality – maximizing the...

point set Multi-objective optimization Nash equilibrium Pareto-efficient envy-free division Social Choice and Individual Values for the "(weak) Pareto principle"...

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

market-clearing level. efficient envy-free division A division of resources among agents that is both Pareto efficient (PE) and envy-free (EF). efficient market hypothesis...

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...

Group envy-freeness (also called: coalition fairness) is a criterion for fair division. A group-envy-free division is a division of a resource among several...

to fair division - a field in the intersection of mathematics, computer science, political science and economics. In the problem of envy-free cake-cutting...

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...

of the total value, where k is the number of groups. A division is called unanimously-envy-free if every agent in every group values his/her group's share...

is secretive. They also show efficient algorithms for almost envy-free (EF1) item allocation and ε-approximate envy-free cake-cutting. The cake redivision...

group-envy-free division guarantees that no subset of agents envies another subset of the same size; this is a stronger condition than envy-freeness. An...

one is fair (e.g. envy-free division) but inefficient, while the other is efficient (e.g. Pareto-optimal) but unfair. Which division do people prefer?...

fast envy-free cake-cutting algorithms, and more economically-efficient envy-free allocations: Discarding some of the cake helps to reduce envy. It enables...

equilibrium is also envy-free. Therefore, market equilibrium computation is a way to find an allocation which is both fair and efficient. The input to the...

If her value is not additive, then the division would still be envy-free but not necessarily Pareto-efficient. Moreover, when the valuations of both partners...

equal amount of each good. An envy-free and Pareto-optimal allocation could be found via Pareto-efficient envy-free division or Weller's theorem. An equitable...

yields a PO and envy-free (hence proportional) allocation in polynomial time for any number of agents. Often, in addition to efficient and fairness, there...

the total amount of envy-instances over all doctors, or the maximum amount of envy-instances per doctor. Envy-freeness Envy-free pricing - a different...

produce an envy-free division if the caller gets the left piece and the other player gets the right piece. (This procedure is not necessarily efficient.) Generalizing...

"Fair and Efficient Allocations of Chores under Bivalued Preferences". arXiv:2110.09601 [cs.GT]. Bai, Yushi; Gölz, Paul (2022-02-11). "Envy-Free and Pareto-Optimal...

given allocation envy-free: this polytope is nonempty iff the original allocation is Pareto-efficient. Connectivity of the undirected envy graph characterizes...

85722.0a. S2CID 153943630. Brams, S. J. (2005). "Efficient Fair Division: Help the Worst off or Avoid Envy?". Rationality and Society. 17 (4): 387–421. CiteSeerX 10...

partners with different valuations in a way that is both Pareto-efficient (PE) and envy-free (EF). Thus, it is possible to divide a cake fairly without compromising...

gives a bound of: 8-4*√3 ≅ 1.07. When the entire cake is divided, an envy-free division is always proportional. Hence the lower bound on the worst-case UPOP...

probabilistic-serial rule, is sd-efficient (which implies ex-post PE) and sd-envy-free (which implies ex-ante envy-freeness), but it is not truthful. It is...

division is not fair: it is not proportional since George receives less than half the total cake value, and it is not envy-free since George envies Alice...

the cake: If the cake is an n-dimensional convex set, then there is an envy-free forced-cut protocol that uses n cuts (one cut per day). Each day, the...

efficient in expectation. Rental harmony - each agent must get a single object and pay a price; the allocation of objects+prices should be envy-free....