Definitions from Wikipedia (Envy minimization)

▸ noun:  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.


▸ Words similar to envy minimization
▸ Usage examples for envy minimization

▸ Idioms related to envy minimization
▸ Wikipedia articles (New!)
▸ Words that often appear near envy minimization
▸ Rhymes of envy minimization

▸ Invented words related to envy minimization