• 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...
    17 KB (3,310 words) - 09:55, 27 May 2025
  • fairness notion. A first solution that comes to mind is to use the envy-graph procedure, that is, each day, the daily item is allocated to an unenvied agent...
    33 KB (3,846 words) - 11:23, 15 July 2025
  • cycles can be removed by moving bundles along the cycle, as in the envy-graph procedure. This strictly increases the total sum of utilities. Hence, after...
    28 KB (3,957 words) - 06:40, 30 June 2025
  • studied was proportional division, and a procedure for n partners was soon found. The stronger criterion of envy-freeness was introduced into the cake-cutting...
    43 KB (5,573 words) - 03:19, 16 July 2025
  • case, when all agents have monotonically increasing utilities, the envy-graph procedure finds a complete EF1 allocation. The only requirement is that the...
    28 KB (3,729 words) - 07:39, 16 July 2024
  • round-robin might fail. However, combining round-robin with the envy-graph procedure gives an algorithm that finds allocations that are both EF1 and satisfy...
    14 KB (1,987 words) - 18:42, 8 June 2025
  • preferences means a higher utility). Undercut procedure and envy-graph procedure - two additional procedures based on the ordinal ranking of bundles. Herreiner...
    3 KB (390 words) - 12:01, 28 May 2025
  • only envy their neighbors. Standard envy-freeness is a special case of social envy-freeness in which the network is the complete graph. Meta envy-freeness...
    11 KB (1,686 words) - 03:27, 27 May 2025
  • The undercut procedure is a procedure for fair item assignment between two people. It provably finds a complete envy-free item assignment whenever such...
    8 KB (1,354 words) - 12:41, 8 July 2024
  • this specific does not need future information (it is based on the Envy-graph procedure). Neoh, Peters and Teh: Sec.6  present semi-online algorithms for...
    32 KB (4,301 words) - 05:51, 11 July 2025
  • specific algorithm does not need future information (it is based on the Envy-graph procedure), so it is in fact an online algorithm.: Sec.6  Kellerer, Kotov,...
    7 KB (923 words) - 18:11, 19 July 2025
  • but not PE. The round-robin procedure returns a complete EF1 allocation with additive utilities. The envy-graph procedure returns a complete EF1 allocation...
    38 KB (5,471 words) - 23:29, 28 July 2024
  • all agents agree on the ranking of goods), and then running the envy-graph procedure starting at the most valuable good. Their algorithm can be seen as...
    70 KB (11,199 words) - 13:27, 1 July 2025
  • while Alice does not envy George's share, she does envy George's role in the procedure. In contrast, consider the alternative procedure in which Alice and...
    13 KB (1,786 words) - 18:37, 15 November 2023
  • software include the concept that a procedure for fair division should be Pareto optimal, equitable and envy free. A procedure for auctions should be one which...
    7 KB (955 words) - 14:18, 12 July 2023
  • [cs.GT]. Aigner-Horev, Elad; Segal-Halevi, Erel (2022). "Envy-free matchings in bipartite graphs and their applications to fair division". Information Sciences...
    25 KB (3,593 words) - 14:40, 21 February 2025
  • 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,510 words) - 15:19, 23 June 2025
  • Hall violator (category Graph theory objects)
    In graph theory, a Hall violator is a set of vertices in a graph, that violate the condition to Hall's marriage theorem. Formally, given a bipartite graph...
    10 KB (1,129 words) - 05:52, 12 April 2025
  • concept of envy-free matching – a matching in which no unmatched agent is adjacent to a matched piece. Step 3. Construct a bipartite graph G = (X + Y...
    6 KB (825 words) - 16:03, 1 January 2024
  • is both equitable and undominated. The adjusted winner procedure calculates an equitable, envy-free and efficient division of a set of divisible goods...
    14 KB (2,082 words) - 21:17, 14 June 2025
  • Kilgour, D. Marc; Klamler, Christian (2011). "The undercut procedure: An algorithm for the envy-free division of indivisible items" (PDF). Social Choice...
    11 KB (1,620 words) - 17:24, 2 July 2025
  • exists an fPO envy-free allocation with 0 sharings. They also demonstrate an alternate approach to enumerating distinct consumption graph for allocations...
    47 KB (6,587 words) - 07:13, 12 May 2025
  • different domains can be presented as DCOPs. The graph coloring problem is as follows: given a graph G = ⟨ N , E ⟩ {\displaystyle G=\langle N,E\rangle...
    30 KB (3,425 words) - 01:27, 2 June 2025
  • classes of society. Sites such as AddictionInfo.org state that this kind of envy has profound effects on other aspects of life and can lead to severe depression...
    237 KB (24,422 words) - 23:37, 7 July 2025
  • 2015. Gregg Keizer (January 29, 2007). "Microsoft's Vista Had Major Mac Envy, Company E-Mails Reveal". Information Week. Archived from the original on...
    185 KB (16,671 words) - 22:19, 14 July 2025
  • Thumbnail for Religion in Iran
    experience persecution like many other minority religions they are still envied by those other minority groups. Regular worshippers in Tehran have even...
    111 KB (11,855 words) - 21:03, 29 June 2025
  • area of dominance that the rest of the world views with a mixture of awe, envy, and resentment: artificial intelligence... From AI models and research to...
    284 KB (29,047 words) - 06:41, 20 July 2025
  • History of Airbus (category Pages using the Graph extension)
    Richard Evans changed the UK defence industry". Financial Times. "Platform envy". The Economist. 12 December 1998. "GEC spoils DASA / BAe party". BBC News...
    85 KB (8,887 words) - 14:41, 14 May 2025
  • Thumbnail for Angela Merkel
    emerging countries, it cannot continue to be so generous. ... She produces graphs of unit labour costs ... at EU meetings in much the same way that the late...
    247 KB (19,784 words) - 16:03, 19 July 2025
  • Ramanujan graph and Ramanujan's sum – Discovered by the Indian mathematician Srinivasa Ramanujan in the early 20th century. Shrikhande graphGraph invented...
    213 KB (23,792 words) - 04:21, 21 July 2025