Chore division (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Chore division" in English language version.

refsWebsite

Global rank English rank

2^nd place

2^nd place

26^th place

20^th place

6^th place

6^th place

70^th place

63^rd place

1openlibrary.org

325^th place

255^th place

207^th place

136^th place

69^th place

59^th place

102^nd place

76^th place

1semanticscholar.org

11^th place

8^th place

archive.org

Gardner, Martin (1978). aha! Insight. New York: W. F. Freeman and Co. ISBN 978-0-7167-1017-2.

arxiv.org

Peterson, Elisha; Francis Edward Su (2009). "N-person envy-free chore division". arXiv:0909.0303 [math.CO].

doi.org

Peterson, Elisha; Su, Francis Edward (2002-04-01). "Four-Person Envy-Free Chore Division". Mathematics Magazine. 75 (2): 117–122. CiteSeerX 10.1.1.16.8992. doi:10.2307/3219145. JSTOR 3219145.
Dehghani, Sina; Alireza Farhadi; MohammadTaghi Hajiaghayi; Hadi Yami (2018). "Envy-free Chore Division for An Arbitrary Number of Agents". Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms. Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms. pp. 2564–2583. doi:10.1137/1.9781611975031.164. ISBN 978-1-61197-503-1.
Heydrich, Sandy; Van Stee, Rob (2015). "Dividing connected chores fairly". Theoretical Computer Science. 593: 51–61. doi:10.1016/j.tcs.2015.05.041. hdl:2381/37387.
Traxler, Martino (2002-01-01). "Fair Chore Division for Climate Change". Social Theory and Practice. 28 (1): 101–134. doi:10.5840/soctheorpract20022814. JSTOR 23559205. S2CID 143631012.

handle.net

hdl.handle.net

Heydrich, Sandy; Van Stee, Rob (2015). "Dividing connected chores fairly". Theoretical Computer Science. 593: 51–61. doi:10.1016/j.tcs.2015.05.041. hdl:2381/37387.

jstor.org

Peterson, Elisha; Su, Francis Edward (2002-04-01). "Four-Person Envy-Free Chore Division". Mathematics Magazine. 75 (2): 117–122. CiteSeerX 10.1.1.16.8992. doi:10.2307/3219145. JSTOR 3219145.
Traxler, Martino (2002-01-01). "Fair Chore Division for Climate Change". Social Theory and Practice. 28 (1): 101–134. doi:10.5840/soctheorpract20022814. JSTOR 23559205. S2CID 143631012.

loc.gov

lccn.loc.gov

Robertson, Jack; Webb, William (1998). Cake-Cutting Algorithms: Be Fair If You Can. Natick, Massachusetts: A. K. Peters. ISBN 978-1-56881-076-8. LCCN 97041258. OL 2730675W.

openlibrary.org

Robertson, Jack; Webb, William (1998). Cake-Cutting Algorithms: Be Fair If You Can. Natick, Massachusetts: A. K. Peters. ISBN 978-1-56881-076-8. LCCN 97041258. OL 2730675W.

psu.edu

citeseerx.ist.psu.edu

Peterson, Elisha; Su, Francis Edward (2002-04-01). "Four-Person Envy-Free Chore Division". Mathematics Magazine. 75 (2): 117–122. CiteSeerX 10.1.1.16.8992. doi:10.2307/3219145. JSTOR 3219145.

semanticscholar.org

api.semanticscholar.org

Traxler, Martino (2002-01-01). "Fair Chore Division for Climate Change". Social Theory and Practice. 28 (1): 101–134. doi:10.5840/soctheorpract20022814. JSTOR 23559205. S2CID 143631012.