Envy-graph procedure
id:
envy-graph-procedure-243-7973753
title:
Envy-graph procedure
text:
The envy-graph procedure is a procedure for fair item allocation. It can be used by several people who want to divide among them several discrete items, such as heirlooms, sweets, or seats in a class. Ideally, we would like the allocation to be envy-free (EF). i.e., to give each agent a bundle that he/she prefers over the bundles of all other agents. However, the items are discrete and cannot be cut, so an envy-free assignment might be impossible. The envy-graph procedure aims to achieve the "ne
brand slug:
wiki
category slug:
encyclopedia
description:
Procedure for fair item allocation
original url:
https://en.wikipedia.org/wiki/Envy-graph_procedure
date created:
date modified:
2024-04-02T13:11:52Z
main entity:
{"identifier":"Q28404391","url":"https://www.wikidata.org/entity/Q28404391"}
image:
fields total:
13
integrity:
14