Divide and choose (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Divide and choose" in English language version.

refsWebsite

Global rank English rank

3doi.org

2^nd place

1jstor.org

26^th place

20^th place

1loc.gov

70^th place

63^rd place

1openlibrary.org

325^th place

255^th place

1springer.com

274^th place

309^th place

1semanticscholar.org

11^th place

8^th place

1un.org

97^th place

164^th place

1web.archive.org

1^st place

1scientificamerican.com

896^th place

674^th place

1arxiv.org

69^th place

59^th place

1harvard.edu

18^th place

17^th place

1fano.co.uk

low place

1ams.org

451^st place

277^th place

ams.org

Better Ways to Cut a Cake by Steven J. Brams, Michael A. Jones, and Christian Klamler in the Notices of the American Mathematical Society December 2006.

arxiv.org

AZIZ, HARIS; MACKENZIE, SIMON (2017). "A Discrete and Bounded Envy-free Cake Cutting Protocol for Any Number of Agents". arXiv:1604.03655. Bibcode:2016arXiv160403655A. {{cite journal}}: Cite journal requires |journal= (help)

doi.org

Young, H. Peyton (1995-01-01). Equity. Princeton University Press. doi:10.1515/9780691214054. ISBN 978-0-691-21405-4.
Walsh, Toby (2011). "Online Cake Cutting". In Brafman, Ronen I.; Roberts, Fred S.; Tsoukiàs, Alexis (eds.). Lecture Notes in Computer Science. Vol. 6992. Berlin, Heidelberg: Springer. pp. 292–305. doi:10.1007/978-3-642-24873-3_22. ISBN 978-3-642-24873-3. S2CID 501890. {{cite book}}: |journal= ignored (help); Missing or empty |title= (help)

dx.doi.org

Young, H. Peyton (1995-01-01). Equity. Princeton University Press. doi:10.1515/9780691214054. ISBN 978-0-691-21405-4.

fano.co.uk

Cake Cutting with Full Knowledge David McQuillan 1999 (not reviewed)

harvard.edu

ui.adsabs.harvard.edu

AZIZ, HARIS; MACKENZIE, SIMON (2017). "A Discrete and Bounded Envy-free Cake Cutting Protocol for Any Number of Agents". arXiv:1604.03655. Bibcode:2016arXiv160403655A. {{cite journal}}: Cite journal requires |journal= (help)

jstor.org

Steinhaus, Hugo (1948). "The problem of fair division". Econometrica. 16 (1): 101–4. JSTOR 1914289.

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.

scientificamerican.com

Klarreich, Erica (October 13, 2016). "The Mathematics of Cake Cutting". Quanta Magazine (Scientific American).

semanticscholar.org

api.semanticscholar.org

Walsh, Toby (2011). "Online Cake Cutting". In Brafman, Ronen I.; Roberts, Fred S.; Tsoukiàs, Alexis (eds.). Lecture Notes in Computer Science. Vol. 6992. Berlin, Heidelberg: Springer. pp. 292–305. doi:10.1007/978-3-642-24873-3_22. ISBN 978-3-642-24873-3. S2CID 501890. {{cite book}}: |journal= ignored (help); Missing or empty |title= (help)

springer.com

link.springer.com

Walsh, Toby (2011). "Online Cake Cutting". In Brafman, Ronen I.; Roberts, Fred S.; Tsoukiàs, Alexis (eds.). Lecture Notes in Computer Science. Vol. 6992. Berlin, Heidelberg: Springer. pp. 292–305. doi:10.1007/978-3-642-24873-3_22. ISBN 978-3-642-24873-3. S2CID 501890. {{cite book}}: |journal= ignored (help); Missing or empty |title= (help)

un.org

United nations (1982-12-10). "Annex III: Basic conditions of prospecting, exploration and exploitation. Article 8". un.org. Archived from the original on 2001-09-14.

web.archive.org

United nations (1982-12-10). "Annex III: Basic conditions of prospecting, exploration and exploitation. Article 8". un.org. Archived from the original on 2001-09-14.