Envy minimization
id:
envy-minimization-311-16858157
title:
Envy minimization
text:
In computer science and operations research, the envy minimization problem is the problem of allocating discrete items among agents with different valuations over the items, such that the 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 no agent envies another agent. That is: no agent prefers the bundle allocated to another agent. However, with indivisible items this might be impossible. One
brand slug:
wiki
category slug:
encyclopedia
description:
Problem in computer science and operations research
original url:
https://en.wikipedia.org/wiki/Envy_minimization
date created:
date modified:
2023-08-24T12:26:44Z
main entity:
{"identifier":"Q106631065","url":"https://www.wikidata.org/entity/Q106631065"}
image:
fields total:
13
integrity:
14