Definition & Meaning | English word ENVY-FREE


ENVY-FREE

Definitions of ENVY-FREE

  1. (of a division of a resource among several partners) Such that every partner feels that his/her allocated share is at least as good as any other share.

Number of letters

9

Is palindrome

No

9
EE
EN
FR
NV
RE
REE
VY

207
E-R
EE
EEE
EEF
EEN
EER
EEV
EF
EFE

Examples of Using ENVY-FREE in a Sentence

  • A reentrant variant of the last diminisher protocol finds an additive approximation to an envy-free division in bounded time.
  • The same analysis shows that the division is envy-free even in the somewhat degenerate case when there are two shouters, and the leftmost piece is given to any of them.
  • An envy-free and Pareto-optimal allocation could be found via Pareto-efficient envy-free division or Weller's theorem.
  • Envy-free pricing - a relaxation of Walrasian equilibrium in which some items may remain unallocated.
  • A reentrant variant of the Last Diminisher protocol finds an additive approximation to an envy-free division in bounded time.
  • Misra and Sethia complement their result by proving that, when n is not fixed, even for non-degenerate valuations, it is NP-hard to decide whether there exists an fPO envy-free allocation with 0 sharings.
  • Indeed, strategyproofness is incompatible with envy-freeness: there is no deterministic strategyproof protocol that always returns an envy-free allocation.
  • Guruswami, Hartline, Karlin, Kempe, Kenyon and McSherry (who introduced the term envy-free pricing) studied two classes of utility functions: unit demand and single-minded.
  • Combining the above lemma with more advanced algorithms can yield, in strongly-polynomial time, allocations that are fPO and envy-free, with at most n-1 sharings.
  • It is strategyproof and envy-free ex-ante, but does not guarantee even approximate envy-free ex-post.
  • Maskin proved the existence of a Pareto-optimal envy-free allocation when the total money endowment is more than (n-1)V.



Search for ENVY-FREE in:






Page preparation took: 265.33 ms.