Consensus-halving via theorems of Borsuk-Ulam and Tucker

Mathematical social sciences

Volumn 45, Issue 1, 2003, Pages 15-25

  Simmons, Forest W ^a   Su, Francis Edward ^b  

^a PORTLAND COMMUNITY COLLEGE   (United States)

^b HARVEY MUDD COLLEGE   (United States)

Author keywords

Borsuk Ulam theorem; Fair division; Tucker's lemma

Indexed keywords

EID: 0037298693     PISSN: 01654896     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0165-4896(02)00087-2     Document Type: Article

References (23)

1. Alon, N., 1987. Splitting necklaces. Advances in Mathematics 63, 247-253.
2. Alon, N., West, D.B., 1986. The Borsuk-Ulam theorem and the bisection of necklaces. Proceedings of the American Mathematical Society 98, 623-628.
3. Austin, A.K., 1982. Sharing a cake. Mathematical Gazette 6 (437), 212-215.
4. Bárány, I., Shlosman, S.B., Szücs, A., 1981. On a topological generalization of a theorem of Tverberg. Journal of the London Mathematical Society 23 (2), 158-164.
5. Barbanel, J.B., 1996. Super envy-free cake division and independence of measures. Journal of Mathematical Analysis and its Applications 197, 54-60.
6. Brams, S.J., Taylor, A.D., 1996. Fair Division: from Cake-Cutting to Dispute Resolution. Cambridge University Press, Cambridge.
7. Brams, S.J., Kilgour, D.M., 2001. Competitive fair division. Journal of Political Economy 109, 418-443.
8. Brams, S.J., Taylor, A.D., Zwicker, W.S., 1997. A moving-knife solution to the four-person envy-free cake-division problem. Proceedings of the American Mathematical Society 125, 547-554.
9. Freund, R.M., Todd, M.J., 1981. A constructive proof of Tucker's combinatorial lemma. Journal of Combinatorial Theory Series A 30, 321-325.
10. Gardner, M., 1978. Aha! Insight. W.F. Freeman, New York.
11. Goldberg, C.H., West, D.B., 1985. Bisection of circle colorings. SIAM Journal on Algebraic and Discrete Methods 6, 93-106.
12. Haake, C.J., Raith, M.G., Su, F.E., 2002. Bidding for envy-freeness: a procedural approach to n-player fair division problems. Social Choice and Welfare 19, 723-749.
13. Lefschetz, S., 1949. Introduction to Topology. Princeton University Press, Princeton, NJ.
14. Peterson, E., Su, F.E., 2002. Four-person envy-free chore division. Mathematics Magazine 75, 117-122.
15. Robertson, J.M., Webb, W.A., 1998. Cake-cutting Algorithms: Be Fair If You Can. A.K. Peters, Natick, MA.
16. Roth, A.E., 1985. Some additional thoughts on post-settlement settlements. Negotiation Journal 1, 245-247.
17. Rotman, J.J., 1988. An Introduction to Algebraic Topology. Springer, New York.
18. Steinhaus, H., 1948. The problem of fair division. Econometrica 16, 101-104.
19. Su, F.E., 1999. Rental harmony: Sperner's lemma in fair division. American Mathematical Monthly 106, 930-942.
20. Todd, M.J., 1976. The Computation of Fixed Points and Applications. Lecture Notes in Economics and Mathematical Systems. Springer, New York.
21. Tucker, A.W., 1945. Some topological properties of the disk and sphere. In: Proceedings of the First Canadian Math. Congress, Montreal, pp. 285-309.
22. Yang, Z., 1999. Computing Equilibria and Fixed Points. Kluwer Academic Publishers, Boston, MA.
23. Ziegler, G.M., 2002. Generalized Kneser coloring theorems with combinatorial proofs. Inventiones Math. 147, 671-691.