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.
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
{"_id":"vqMbZuhbLHuyrBruq","bibbaseid":"misra-sethia-fairdivisionishardevenforamicableagents-2021","author_short":["Misra, N.","Sethia, A."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Neeldhara"],"propositions":[],"lastnames":["Misra"],"suffixes":[]},{"firstnames":["Aditi"],"propositions":[],"lastnames":["Sethia"],"suffixes":[]}],"editor":[{"firstnames":["Tomás"],"propositions":[],"lastnames":["Bures"],"suffixes":[]},{"firstnames":["Riccardo"],"propositions":[],"lastnames":["Dondi"],"suffixes":[]},{"firstnames":["Johann"],"propositions":[],"lastnames":["Gamper"],"suffixes":[]},{"firstnames":["Giovanna"],"propositions":[],"lastnames":["Guerrini"],"suffixes":[]},{"firstnames":["Tomasz"],"propositions":[],"lastnames":["Jurdzinski"],"suffixes":[]},{"firstnames":["Claus"],"propositions":[],"lastnames":["Pahl"],"suffixes":[]},{"firstnames":["Florian"],"propositions":[],"lastnames":["Sikora"],"suffixes":[]},{"firstnames":["Prudence","W.","H."],"propositions":[],"lastnames":["Wong"],"suffixes":[]}],"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","bibtex":"@inproceedings{DBLP:conf/sofsem/MisraS21,\n author = {Neeldhara Misra and\n Aditi Sethia},\n editor = {Tom{\\'{a}}s Bures and\n Riccardo Dondi and\n Johann Gamper and\n Giovanna Guerrini and\n Tomasz Jurdzinski and\n Claus Pahl and\n Florian Sikora and\n Prudence W. H. Wong},\n title = {Fair Division Is Hard Even for Amicable Agents},\n booktitle = {{SOFSEM} 2021: Theory and Practice of Computer Science - 47th International\n Conference on Current Trends in Theory and Practice of Computer Science,\n {SOFSEM} 2021, Bolzano-Bozen, Italy, January 25-29, 2021, Proceedings},\n series = {Lecture Notes in Computer Science},\n volume = {12607},\n pages = {421--430},\n publisher = {Springer},\n year = {2021},\n url = {https://doi.org/10.1007/978-3-030-67731-2\\_31},\n doi = {10.1007/978-3-030-67731-2\\_31},\n timestamp = {Mon, 25 Jan 2021 18:01:23 +0100},\n biburl = {https://dblp.org/rec/conf/sofsem/MisraS21.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Misra, N.","Sethia, A."],"editor_short":["Bures, T.","Dondi, R.","Gamper, J.","Guerrini, G.","Jurdzinski, T.","Pahl, C.","Sikora, F.","Wong, P. W. H."],"key":"DBLP:conf/sofsem/MisraS21","id":"DBLP:conf/sofsem/MisraS21","bibbaseid":"misra-sethia-fairdivisionishardevenforamicableagents-2021","role":"author","urls":{"Paper":"https://doi.org/10.1007/978-3-030-67731-2_31"},"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"https://dblp.org/pid/85/6789.bib","dataSources":["tDMHZRX27gzjeY5r7"],"keywords":[],"search_terms":["fair","division","hard","even","amicable","agents","misra","sethia"],"title":"Fair Division Is Hard Even for Amicable Agents","year":2021}