IDEAS home Printed from https://ideas.repec.org/a/eee/mateco/v78y2018icp1-5.html
   My bibliography  Save this article

No bullying! A playful proof of Brouwer’s fixed-point theorem

Author

Listed:
  • Petri, Henrik
  • Voorneveld, Mark

Abstract

We give an elementary proof of Brouwer’s fixed-point theorem. The only mathematical prerequisite is a version of the Bolzano–Weierstrass theorem: a sequence in a compact subset of n-dimensional Euclidean space has a convergent subsequence with a limit in that set. Our main tool is a ‘no-bullying’ lemma for agents with preferences over indivisible goods. What does this lemma claim? Consider a finite number of children, each with a single indivisible good (a toy) and preferences over those toys. Let us say that a group of children, possibly after exchanging toys, could bully some poor kid if all group members find their own current toy better than the toy of this victim. The no-bullying lemma asserts that some group S of children can redistribute their toys among themselves in such a way that all members of S get their favorite toy from S, but they cannot bully anyone.

Suggested Citation

  • Petri, Henrik & Voorneveld, Mark, 2018. "No bullying! A playful proof of Brouwer’s fixed-point theorem," Journal of Mathematical Economics, Elsevier, vol. 78(C), pages 1-5.
    • Handle: RePEc:eee:mateco:v:78:y:2018:i:c:p:1-5
    DOI: 10.1016/j.jmateco.2018.07.001
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0304406818300703
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.jmateco.2018.07.001?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Voorneveld, Mark, 2017. "An elementary direct proof that the Knaster–Kuratowski–Mazurkiewicz lemma implies Sperner’s lemma," Economics Letters, Elsevier, vol. 158(C), pages 1-2.
    2. Shapley, Lloyd & Scarf, Herbert, 1974. "On cores and indivisibility," Journal of Mathematical Economics, Elsevier, vol. 1(1), pages 23-37, March.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Данилов В.И., 2019. "Лемма Скарфа И Теорема Брауэра," Журнал Экономика и математические методы (ЭММ), Центральный Экономико-Математический Институт (ЦЭМИ), vol. 55(3), pages 141-143, июль.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Petri, Henrik & Voorneveld, Mark, 2016. "No bullying! A playful proof of Brouwer's fixed-point theorem," SSE Working Paper Series in Economics 2016:3, Stockholm School of Economics, revised 20 Jun 2017.
    2. Alvin E. Roth & Tayfun Sönmez & M. Utku Ünver, 2004. "Kidney Exchange," The Quarterly Journal of Economics, President and Fellows of Harvard College, vol. 119(2), pages 457-488.
    3. Can, Burak & Pourpouneh, Mohsen & Storcken, Ton, 2017. "Cost of transformation: a measure on matchings," Research Memorandum 015, Maastricht University, Graduate School of Business and Economics (GSBE).
    4. Buechel, Berno & Krähenmann, Philemon, 2022. "Fixed price equilibria on peer‐to‐peer platforms: Lessons from time‐based currencies," Journal of Economic Behavior & Organization, Elsevier, vol. 195(C), pages 335-358.
    5. Pablo Guillen & Róbert F. Veszteg, 2021. "Strategy-proofness in experimental matching markets," Experimental Economics, Springer;Economic Science Association, vol. 24(2), pages 650-668, June.
    6. Battal Doğan & M. Bumin Yenmez, 2023. "When does an additional stage improve welfare in centralized assignment?," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 76(4), pages 1145-1173, November.
    7. Zhiwei Cui & Yan-An Hwang, 2017. "House exchange and residential segregation in networks," International Journal of Game Theory, Springer;Game Theory Society, vol. 46(1), pages 125-147, March.
    8. Yajing Chen & Zhenhua Jiao & Chenfeng Zhang & Luosai Zhang, 2021. "The Machiavellian frontier of top trading cycles," Papers 2106.14456, arXiv.org, revised Apr 2024.
    9. Takamiya, Koji, 2001. "Coalition strategy-proofness and monotonicity in Shapley-Scarf housing markets," Mathematical Social Sciences, Elsevier, vol. 41(2), pages 201-213, March.
    10. Ivan Balbuzanov & Maciej H. Kotowski, 2019. "Endowments, Exclusion, and Exchange," Econometrica, Econometric Society, vol. 87(5), pages 1663-1692, September.
    11. Somdeb Lahiri, 2007. "Core and equilibria in an assembled product industry," Review of Economic Design, Springer;Society for Economic Design, vol. 10(4), pages 327-339, March.
    12. repec:spo:wpecon:info:hdl:2441/5rkqqmvrn4tl22s9mc0o6ctj2 is not listed on IDEAS
    13. A. Talman & Zaifu Yang, 2015. "An efficient multi-item dynamic auction with budget constrained bidders," International Journal of Game Theory, Springer;Game Theory Society, vol. 44(3), pages 769-784, August.
    14. Quesada, Antonio, 2009. "Allocation of objects with conditional property rights," MPRA Paper 19469, University Library of Munich, Germany.
    15. Roth, Alvin E., 1985. "Common and conflicting interests in two-sided matching markets," European Economic Review, Elsevier, vol. 27(1), pages 75-96, February.
    16. Ehlers, Lars & Klaus, Bettina, 2016. "Object allocation via deferred-acceptance: Strategy-proofness and comparative statics," Games and Economic Behavior, Elsevier, vol. 97(C), pages 128-146.
    17. Kumano, Taro, 2013. "Strategy-proofness and stability of the Boston mechanism: An almost impossibility result," Journal of Public Economics, Elsevier, vol. 105(C), pages 23-29.
    18. Bade, Sophie, 2011. "Matching Allocation Problems with Endogenous Information Acquisition," VfS Annual Conference 2011 (Frankfurt, Main): The Order of the World Economy - Lessons from the Crisis 48735, Verein für Socialpolitik / German Economic Association.
    19. Kawasaki, Ryo, 2010. "Farsighted stability of the competitive allocations in an exchange economy with indivisible goods," Mathematical Social Sciences, Elsevier, vol. 59(1), pages 46-52, January.
    20. Roth, Alvin E. & Sonmez, Tayfun & Utku Unver, M., 2005. "Pairwise kidney exchange," Journal of Economic Theory, Elsevier, vol. 125(2), pages 151-188, December.
    21. Diebold, Franz & Bichler, Martin, 2017. "Matching with indifferences: A comparison of algorithms in the context of course allocation," European Journal of Operational Research, Elsevier, vol. 260(1), pages 268-282.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:mateco:v:78:y:2018:i:c:p:1-5. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/jmateco .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.