The efficiency of fair division with connected pieces, International Workshop on Internet and Network Economics, pp.26-37, 2010. ,
Algorithms for max-min share fair allocation of indivisible chores, Proceedings of the 31st AAAI Conference on Artificial Intelligence (AAAI-17), pp.335-341, 2017. ,
Approximation hardness of short symmetric instances of MAX-3SAT, Electronic Colloquium on Computational Complexity Report, p.49, 2003. ,
Almost envy-free allocations with connected bundles, 2018. ,
Fair allocation of indivisible goods, 2015. ,
Fair division of a graph, Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI-17), pp.135-141, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01609255
A moving knife solution to the four-person envyfree cake division problem, Proceedings of the American Mathematical Society, vol.125, pp.547-554, 1997. ,
The combinatorial assignment problem: Approximate competitive equilibrium from equal incomes, Journal of Political Economy, vol.119, issue.6, pp.1061-1103, 2011. ,
The efficiency of fair division. Theory of Computing Systems, vol.50, pp.589-610, 2012. ,
On the computability of equitable divisions, Discrete Optimization, vol.9, pp.249-257, 2012. ,
On the existence of equitable divisions, Information Sciences, vol.228, pp.239-245, 2013. ,
Allocating goods on a graph to eliminate envy, Proceedings of the 22nd AAAI Conference on Artificial Intelligence (AAAI-07), pp.700-705, 2007. ,
Envy-free chore division for an arbitrary number of agents, Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.2564-2583, 2018. ,
Equitable distribution of indivisible items, Mathematical Social Sciences, vol.16, pp.145-158, 1998. ,
On the complexity of chore division, Proceedings of the 27th International Joint Conference on Artificial Intelligence (IJCAI-18), pp.226-232, 2018. ,
, Aha! Insight, 1978.
Computers and Intractability, a Guide to the Theory of NPcompleteness, 1979. ,
Object allocation via swaps along a social network, Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI-17), pp.213-219, 2017. ,
Dividing connected chores fairly, Theoretical Computer Science, vol.593, pp.51-61, 2015. ,
Pareto-optimal allocation of indivisible goods with connectivity constraints, 2018. ,
On approximately fair allocations of indivisible goods, Proceedings of EC'04, 2004. ,
Maximin share allocations on cycles, Proceedings of the 27th International Joint Conference on Artificial Intelligence (IJCAI-18), pp.410-416, 2018. ,
On worst-case allocations in the presence of indivisible goods, Internet and Network Economics -7th International Workshop, vol.7090, 2011. ,
Four-person envy-free chore division, Mathematics Magazine, vol.75, issue.2, pp.117-122, 2002. ,
Cake-cutting Algorithms: Be Fair if You Can, 1998. ,
, Economics and Computation: An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division, 2015.
The problem of fair division, Econometrica, vol.16, pp.101-104, 1948. ,
How to cut a cake fairly, American Mathematical Monthly, vol.87, pp.640-644, 1980. ,
Fairly allocating contiguous blocks of indivisible items, Proceedings of the 10th International Symposium on Algorithmic Game Theory (SAGT'17), pp.333-344, 2017. ,
Dividing a cake fairly, Journal of Mathematical Analysis and Applications, vol.78, pp.233-247, 1980. ,