• 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...
    4 KB (596 words) - 18:34, 12 March 2025
  • allocations; see envy-free item allocation. Finding partial envy-free allocations that are as large as possible; see envy-free matching. Using randomization...
    11 KB (1,686 words) - 03:27, 24 August 2023
  • In economics and social choice theory, a no-justified-envy matching is a matching in a two-sided market, in which no agent prefers the assignment of another...
    7 KB (975 words) - 18:04, 23 August 2024
  • perfect matching polytope of a graph is a polytope in R|E| in which each corner is an incidence vector of a perfect matching. Envy-free matching Maximum-cardinality...
    7 KB (949 words) - 19:27, 6 February 2025
  • 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...
    28 KB (3,729 words) - 07:39, 16 July 2024
  • preference-ordering. Envy-free matching – a relaxation of stable matching for many-to-one matching problems Rainbow matching for edge colored graphs Stable matching polytope...
    21 KB (2,544 words) - 05:46, 26 April 2025
  • computer science, political science and economics. In the problem of envy-free cake-cutting, there is a cake modeled as an interval, and n {\displaystyle...
    25 KB (3,593 words) - 14:40, 21 February 2025
  • Dulmage–Mendelsohn decomposition (category Matching (graph theory))
    maximum-cardinality envy-free matching in an unweighted bipartite graph, as well as a minimum-cost maximum-cardinality matching in a weighted bipartite...
    9 KB (1,179 words) - 19:55, 12 October 2024
  • graph on the sets of agents and houses. An envy-free house allocation corresponds to an envy-free matching in this graph. The following algorithmic problems...
    13 KB (1,778 words) - 03:10, 6 July 2024
  • 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...
    21 KB (2,559 words) - 14:47, 17 March 2025
  • shorter description appears in and is based on the concept of envy-free matching – a matching in which no unmatched agent is adjacent to a matched piece...
    6 KB (825 words) - 16:03, 1 January 2024
  • 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...
    10 KB (1,443 words) - 10:35, 28 May 2024
  • Rural hospitals theorem (category Stable matching)
    unmatched in A, must be unmatched in B too. National Resident Matching Program Envy-free matching Roth, Alvin E. (1986-03-01). "On the Allocation of Residents...
    6 KB (827 words) - 18:57, 8 January 2022
  • multi-edge matchings. Fair item assignment Stable matching Envy-free matching Priority matching Irving, Robert W. (2003). Greedy matchings. University...
    8 KB (1,290 words) - 23:19, 25 August 2023
  • allocation of goods, and a 1-out-of(2n/3) MMS allocation of chores, using envy-free matching. A 1-out-of-(3n/2) MMS allocation of goods,which can be computed in...
    70 KB (11,200 words) - 11:45, 28 August 2024
  • one-sided matching) is a kind of a fair division problem. In an assignment problem (also called house-allocation problem or one-sided matching), there are...
    16 KB (2,211 words) - 20:45, 21 February 2024
  • y iff x values y at least 1. Find a maximum-cardinality envy-free matching in G (a matching in which no unmatched agent is adjacent to a matched piece)...
    13 KB (1,786 words) - 18:37, 15 November 2023
  • then A envies B. Dubins and Spanier proved that, when all value-measures are strictly positive, every relative-leximin allocation is envy-free.: Sec.4 ...
    7 KB (928 words) - 04:12, 15 April 2024
  • fairness. Envy-free matching - each agent should get at most one object; the goal is to maximize the number of assignments subject to envy-freeness. Fair...
    40 KB (6,105 words) - 18:03, 22 April 2025
  • Hall violator (category Matching (graph theory))
    (2006). "Bipartite Matching & the Hungarian Method" (PDF). Segal-Halevi, Erel; Aigner-Horev, Elad (2019-01-28). "Envy-free Matchings in Bipartite Graphs...
    10 KB (1,129 words) - 05:52, 12 April 2025
  • indivisible items among several people, such that the allocation is "almost" envy-free: each agent believes that the bundle they received is at least as good...
    13 KB (1,846 words) - 15:37, 7 August 2024
  • maximum 3-dimensional matching, in which each vertex appears exactly twice. Note that an envy-free allocation with subsidy remains envy-free if a fixed amount...
    28 KB (3,957 words) - 12:12, 12 April 2024
  • efficiency. Applications. The dual "adequacy"; relation. Actual envy and the definition of envy-free preferences and their properties. Other related principles...
    9 KB (1,037 words) - 22:06, 29 May 2024
  • probabilities over the rows of all other people (this property is called envy-freeness). This raises the question of how to implement this randomized allocation...
    10 KB (1,507 words) - 21:02, 14 April 2025
  • define an approximation to envy-freeness called EFM (envy-freeness for mixed items), which generalizes both envy-freeness for divisible items and EF1...
    47 KB (6,587 words) - 07:13, 12 May 2025
  • 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 impossible to enjoy...
    7 KB (952 words) - 11:50, 26 March 2023
  • lesbian ninja Roxy Richter, while also confronting his own ex, pop star Envy Adams. Scott grows frustrated during the process, and after an outburst regarding...
    166 KB (17,476 words) - 18:36, 14 May 2025
  • ISBN 978-3-031-15714-1. Plaut, Benjamin; Roughgarden, Tim (2020-01-01). "Almost Envy-Freeness with General Valuations". SIAM Journal on Discrete Mathematics. 34 (2):...
    22 KB (2,969 words) - 02:55, 3 December 2024
  • allocation. When the agents have additive linear valuations, the allocation is envy-free. The PA mechanism, which does not use payments, is analogous to the VCG...
    3 KB (503 words) - 11:37, 8 August 2023
  • possible-PE, possible-truthfulness, and necessary-envy-freeness. See also: Truthful one-sided matching. There are several truthful algorithms that find...
    13 KB (1,711 words) - 02:34, 16 January 2025