Login / Signup

Computational complexity of necessary envy-freeness.

Haris AzizIldikó SchlotterToby Walsh
Published in: Math. Soc. Sci. (2024)
Keyphrases
  • computational complexity
  • envy freeness
  • np complete
  • special case
  • neural network
  • decision problems
  • computationally efficient
  • auction mechanisms