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]

@article{AzizSW24,
  title = {Computational complexity of necessary envy-freeness},
  author = {Haris Aziz 0001 and Ildikó Schlotter and Toby Walsh},
  year = {2024},
  doi = {10.1016/j.mathsocsci.2023.08.002},
  url = {https://doi.org/10.1016/j.mathsocsci.2023.08.002},
  researchr = {https://researchr.org/publication/AzizSW24},
  cites = {0},
  citedby = {0},
  journal = {Mathematical Social Sciences},
  volume = {127},
  pages = {86-98},
}