HIGHLIGHTS
- who: Ayumi Igarashi from the National Institute of Informatics, Tokyo, Japan Murat Sertel Center for Advanced Economic Studies, Istanbul Bilgi University, Istanbul, Turkey have published the research: Fair division of graphs and of tangled cakes, in the Journal: (JOURNAL)
- what: To the unit interval itself the authors show that only five other stringable tangles guarantee the existence of envyfree and connected allocations for arbitrarily many agents with the corresponding topological classes containing only traceable graphs. The authors provide two somewhat different answers (which are restated more precisely in Sect 9): There exist infinite topological classes . . .
If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.