Computational complexity of necessary envy-freeness

Haris Aziz 0001, Ildikó Schlotter, Toby Walsh. Computational complexity of necessary envy-freeness. Mathematical Social Sciences, 127:86-98, 2024. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.