English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

On Fair Division for Indivisible Items

MPS-Authors
/persons/resource/persons225687

Ray Chaudhury,  Bhaskar
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45021

Mehlhorn,  Kurt
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

http://drops.dagstuhl.de/opus/volltexte/2018/9924/
(Publisher version)

http://drops.dagstuhl.de/doku/urheberrecht1.html
(Copyright transfer agreement)

Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Ray Chaudhury, B., Cheung, Y. K., Garg, J., Garg, N., Hoefer, M., & Mehlhorn, K. (2018). On Fair Division for Indivisible Items. In S. Ganguly, & P. Pandya (Eds.), 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (pp. 1-17). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.FSTTCS.2018.25.


Cite as: https://hdl.handle.net/21.11116/0000-0002-AAE1-0
Abstract
There is no abstract available