Fair Division Is Hard Even for Amicable Agents. Misra, N. & Sethia, A. In Bures, T., Dondi, R., Gamper, J., Guerrini, G., Jurdzinski, T., Pahl, C., Sikora, F., & Wong, P. W. H., editors, SOFSEM 2021: Theory and Practice of Computer Science - 47th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2021, Bolzano-Bozen, Italy, January 25-29, 2021, Proceedings, volume 12607, of Lecture Notes in Computer Science, pages 421–430, 2021. Springer.
Fair Division Is Hard Even for Amicable Agents [link]Paper  doi  bibtex   
@inproceedings{DBLP:conf/sofsem/MisraS21,
  author    = {Neeldhara Misra and
               Aditi Sethia},
  editor    = {Tom{\'{a}}s Bures and
               Riccardo Dondi and
               Johann Gamper and
               Giovanna Guerrini and
               Tomasz Jurdzinski and
               Claus Pahl and
               Florian Sikora and
               Prudence W. H. Wong},
  title     = {Fair Division Is Hard Even for Amicable Agents},
  booktitle = {{SOFSEM} 2021: Theory and Practice of Computer Science - 47th International
               Conference on Current Trends in Theory and Practice of Computer Science,
               {SOFSEM} 2021, Bolzano-Bozen, Italy, January 25-29, 2021, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {12607},
  pages     = {421--430},
  publisher = {Springer},
  year      = {2021},
  url       = {https://doi.org/10.1007/978-3-030-67731-2\_31},
  doi       = {10.1007/978-3-030-67731-2\_31},
  timestamp = {Mon, 25 Jan 2021 18:01:23 +0100},
  biburl    = {https://dblp.org/rec/conf/sofsem/MisraS21.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0