{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:49:51Z","timestamp":1743137391790,"version":"3.40.3"},"publisher-location":"New York, NY","reference-count":33,"publisher":"Springer New York","isbn-type":[{"type":"print","value":"9780387758886"},{"type":"electronic","value":"9780387304403"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-0-387-30440-3_198","type":"book-chapter","created":{"date-parts":[[2009,6,17]],"date-time":"2009-06-17T16:54:06Z","timestamp":1245257646000},"page":"3327-3334","source":"Crossref","is-referenced-by-count":0,"title":["Fair Division*"],"prefix":"10.1007","author":[{"given":"Steven J.","family":"Brams","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"198_CR1_198","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511546679","volume-title":"The Geometry of Efficient Fair Division","author":"JB Barbanel","year":"2005","unstructured":"Barbanel JB (2005) The Geometry of Efficient Fair Division. Cambridge University Press, New York"},{"issue":"3","key":"198_CR2_198","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/j.mathsocsci.2004.03.006","volume":"48","author":"JB Barbanel","year":"2004","unstructured":"Barbanel JB, Brams SJ (2004) Cake Division with Minimal Cuts: Envy-Free Procedures for 3 Persons, 4 Persons, and Beyond. Math Soc Sci 48(3):251\u2013269","journal-title":"Math Soc Sci"},{"key":"198_CR3_198","unstructured":"Barbanel JB, Brams SJ (2007) Cutting a\u00a0Pie Is Not a\u00a0Piece of Cake. Am Math Month (forthcoming)"},{"issue":"6","key":"198_CR4_198","doi-asserted-by":"crossref","first-page":"300","DOI":"10.2307\/2678433","volume":"98","author":"SJ Brams","year":"2001","unstructured":"Brams SJ, Edelman PH, Fishburn PC (2001) Paradoxes of Fair Division. J\u00a0Philos 98(6):300\u2013314","journal-title":"J Philos"},{"issue":"2","key":"198_CR5_198","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1023\/B:THEO.0000024421.85722.0a","volume":"55","author":"SJ Brams","year":"2004","unstructured":"Brams SJ, Edelman PH, Fishburn PC (2004) Fair Division of Indivisible Items. Theory Decis 55(2):147\u2013180","journal-title":"Theory Decis"},{"issue":"2","key":"198_CR6_198","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/s003550050019","volume":"17","author":"SJ Brams","year":"2000","unstructured":"Brams SJ, Fishburn PC (2000) Fair Division of Indivisible Items Between Two People with Identical Preferences: Envy-Freeness, Pareto\u2010Optimality, and Equity. Soc Choice Welf 17(2):247\u2013267","journal-title":"Soc Choice Welf"},{"issue":"11","key":"198_CR7_198","first-page":"1314","volume":"35","author":"SJ Brams","year":"2006","unstructured":"Brams SJ, Jones MA, Klamler C (2006) Better Ways to Cut a\u00a0Cake. Not AMS 35(11):1314\u20131321","journal-title":"Not AMS"},{"issue":"3\u20134","key":"198_CR8_198","first-page":"353","volume":"36","author":"SJ Brams","year":"2007","unstructured":"Brams SJ, Jones MA, Klamler C (2007) Proportional Pie Cutting. Int J Game Theory 36(3\u20134):353\u2013367","journal-title":"Int J Game Theory"},{"issue":"2","key":"198_CR9_198","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1177\/0951629804041118","volume":"16","author":"SJ Brams","year":"2004","unstructured":"Brams SJ, Kaplan TR (2004) Dividing the Indivisible: Procedures for Allocating Cabinet Ministries in a\u00a0Parliamentary System. J\u00a0Theor Politics 16(2):143\u2013173","journal-title":"J Theor Politics"},{"issue":"2","key":"198_CR10_198","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1086\/319550","volume":"109","author":"SJ Brams","year":"2001","unstructured":"Brams SJ, Kilgour MD (2001) Competitive Fair Division. J\u00a0Political Econ 109(2):418\u2013443","journal-title":"J Political Econ"},{"issue":"4","key":"198_CR11_198","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1177\/1043463105058317","volume":"17","author":"SJ Brams","year":"2004","unstructured":"Brams SJ, King DR (2004) Efficient Fair Division: Help the Worst Off or Avoid Envy? Ration Soc 17(4):387\u2013421","journal-title":"Ration Soc"},{"issue":"1","key":"198_CR12_198","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1080\/00029890.1995.11990526","volume":"102","author":"SJ Brams","year":"1995","unstructured":"Brams SJ, Taylor AD (1995) An Envy-Free Cake Division Protocol. Am Math Month 102(1):9\u201318","journal-title":"Am Math Month"},{"key":"198_CR13_198","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511598975","volume-title":"Fair Division: From Cake\u2010Cutting to Dispute Resolution","author":"SJ Brams","year":"1996","unstructured":"Brams SJ, Taylor AD (1996) Fair Division: From Cake\u2010Cutting to Dispute Resolution. Cambridge University Press, New York"},{"issue":"16","key":"198_CR14_198","first-page":"47","volume":"9","author":"SJ Brams","year":"1999a","unstructured":"Brams SJ, Taylor AD (1999a) Calculating Consensus. Corp Couns 9(16):47\u201350","journal-title":"Corp Couns"},{"key":"198_CR15_198","volume-title":"The Win-Win Solution: Guaranteeing Fair Shares to Everybody. W.W","author":"SJ Brams","year":"1999b","unstructured":"Brams SJ, Taylor AD (1999b) The Win-Win Solution: Guaranteeing Fair Shares to Everybody. W.W. Norton, New York"},{"issue":"4","key":"198_CR16_198","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1007\/BF03024785","volume":"17","author":"SJ Brams","year":"1995","unstructured":"Brams SJ, Taylor AD, Zwicker SW (1995) Old and New Moving\u2010Knife Schemes. Math Intell 17(4):30\u201335","journal-title":"Math Intell"},{"issue":"2","key":"198_CR17_198","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1090\/S0002-9939-97-03614-9","volume":"125","author":"SJ Brams","year":"1997","unstructured":"Brams SJ, Taylor AD, Zwicker WS (1997) A\u00a0Moving\u2010Knife Solution to the Four\u2010Person Envy-Free Cake Division Problem. Proc Am Math Soc 125(2):547\u2013554","journal-title":"Proc Am Math Soc"},{"issue":"3","key":"198_CR18_198","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/S0165-4896(00)00065-2","volume":"41","author":"PH Edelman","year":"2001","unstructured":"Edelman PH, Fishburn PC (2001) Fair Division of Indivisible Items Among People with Similar Preferences. Math Soc Sci 41(3):327\u2013347","journal-title":"Math Soc Sci"},{"issue":"3","key":"198_CR19_198","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0166-218X(84)90005-2","volume":"7","author":"S Even","year":"1984","unstructured":"Even S, Paz A (1984) A\u00a0Note on Cake Cutting. Discret Appl Math 7(3):285\u2013296","journal-title":"Discret Appl Math"},{"issue":"4","key":"198_CR20_198","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1007\/s003550100149","volume":"19","author":"CJ Haake","year":"2002","unstructured":"Haake CJ, Raith MG, Su FE (2002) Bidding for Envy-Freeness: A\u00a0Procedural Approach to\u00a0n\u2011Player Fair Division Problems. Soc Choice Welf 19(4):723\u2013749","journal-title":"Soc Choice Welf"},{"issue":"2","key":"198_CR21_198","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1007\/s003550100119","volume":"19","author":"D Herreiner","year":"2002","unstructured":"Herreiner D, Puppe C (2002) A\u00a0Simple Procedure for Finding Equitable Allocations of Indivisible Goods. Soc Choice Welf 19(2):415\u2013430","journal-title":"Soc Choice Welf"},{"issue":"4","key":"198_CR22_198","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1080\/0025570X.2002.11953144","volume":"75","author":"MA Jones","year":"2002","unstructured":"Jones MA (2002) Equitable, Envy-Free, and Efficient Cake Cutting for Two People and Its Application to Divisible Goods. Math Mag 75(4):275\u2013283","journal-title":"Math Mag"},{"key":"198_CR23_198","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/2954.001.0001","volume-title":"Fair Division and Collective Welfare","author":"HJ Moulin","year":"2003","unstructured":"Moulin HJ (2003) Fair Division and Collective Welfare. MIT Press, Cambridge"},{"issue":"2","key":"198_CR24_198","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1080\/0025570X.2002.11953114","volume":"75","author":"E Peterson","year":"2000","unstructured":"Peterson E, Su FE (2000) Four\u2010Person Envy-Free Chore Division. Math Mag 75(2):117\u2013122","journal-title":"Math Mag"},{"key":"198_CR25_198","doi-asserted-by":"crossref","unstructured":"Pikhurko O (2000)On Envy-Free Cake Division. Am Math Month 107(8):736\u2013738","DOI":"10.1080\/00029890.2000.12005263"},{"issue":"5","key":"198_CR26_198","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1023\/A:1020485018300","volume":"11","author":"RF Potthoff","year":"2002","unstructured":"Potthoff RF (2002) Use of Linear Programming to Find an Envy-Free Solution Closest to the Brams\u2010Kilgour Gap Solution for the Housemates Problem. Group Decis Negot 11(5):405\u2013414","journal-title":"Group Decis Negot"},{"key":"198_CR27_198","first-page":"97","volume":"45","author":"JM Robertson","year":"1997","unstructured":"Robertson JM, Webb WA (1997) Near Exact and Envy-Free Cake Division. Ars Comb 45:97\u2013108","journal-title":"Ars Comb"},{"key":"198_CR28_198","doi-asserted-by":"crossref","DOI":"10.1201\/9781439863855","volume-title":"Cake-Cutting Algorithms: Be Fair If You Can","author":"J Robertson","year":"1998","unstructured":"Robertson J, Webb W (1998) Cake-Cutting Algorithms: Be Fair If You Can. AK Peters, Natick"},{"issue":"2","key":"198_CR29_198","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1023\/A:1008620404353","volume":"8","author":"H Shishido","year":"1999","unstructured":"Shishido H, Zeng DZ (1999) Mark\u2010Choose\u2010Cut Algorithms for Fair and Strongly Fair Division. Group Decis Negot 8(2):125\u2013137","journal-title":"Group Decis Negot"},{"issue":"8","key":"198_CR30_198","doi-asserted-by":"crossref","first-page":"640","DOI":"10.1080\/00029890.1980.11995109","volume":"87","author":"W Stromquist","year":"1980","unstructured":"Stromquist W (1980) How to Cut a\u00a0Cake Fairly. Am Math Month 87(8):640\u2013644","journal-title":"Am Math Month"},{"key":"198_CR31_198","first-page":"922","volume":"106","author":"FE Su","year":"1999","unstructured":"Su FE (1999) Rental Harmony: Sperner's Lemma in Fair Division. Am Math Month 106:922\u2013934","journal-title":"Am Math Month"},{"key":"198_CR32_198","volume-title":"Equity in Theory and Practice","author":"HP Young","year":"1994","unstructured":"Young HP (1994) Equity in Theory and Practice. Princeton University Press, Princeton"},{"key":"198_CR33_198","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/978-1-4615-4627-6_17","volume-title":"Approximate Envy-Free Procedures. Game Practice: Contributions from Applied Game Theory","author":"DZ Zeng","year":"2000","unstructured":"Zeng DZ (2000) Approximate Envy-Free Procedures. Game Practice: Contributions from Applied Game Theory. Kluwer Academic Publishers, Dordrecht, pp. 259\u2013271"}],"container-title":["Encyclopedia of Complexity and Systems Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30440-3_198","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,10]],"date-time":"2025-02-10T05:57:52Z","timestamp":1739167072000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30440-3_198"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9780387758886","9780387304403"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30440-3_198","relation":{},"subject":[],"published":{"date-parts":[[2009]]}}}