IDEAS home Printed from https://ideas.repec.org/a/wly/soecon/v80y2014i3p855-865.html
   My bibliography  Save this article

Having More Fun with Organized Kissing

Author

Listed:
  • Matthew Wiser
  • Gloria Yeomans-Maldonado
  • Sudipta Sarangi

Abstract

Several current issues in economics are centered on scheduling and matching problems, notably including the 2012 Nobel Prize winning work. Such problems usually lie outside the scope of most undergraduate courses. We present a relatively simple problem that can be used to introduce the graph theory needing to teach these interesting but somewhat difficult topics.

Suggested Citation

  • Matthew Wiser & Gloria Yeomans-Maldonado & Sudipta Sarangi, 2014. "Having More Fun with Organized Kissing," Southern Economic Journal, John Wiley & Sons, vol. 80(3), pages 855-865, January.
    • Handle: RePEc:wly:soecon:v:80:y:2014:i:3:p:855-865
    DOI: 10.4284/0038-4038-2012.266
    as

    Download full text from publisher

    File URL: https://doi.org/10.4284/0038-4038-2012.266
    Download Restriction: no
    File URL: https://libkey.io/10.4284/0038-4038-2012.266?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
    ---><---

    References listed on IDEAS

    as
    1. Jackson, Matthew O. & Wolinsky, Asher, 1996. "A Strategic Model of Social and Economic Networks," Journal of Economic Theory, Elsevier, vol. 71(1), pages 44-74, October.
    2. Wu, Ximing, 2003. "Calculation of maximum entropy densities with application to income distribution," Journal of Econometrics, Elsevier, vol. 115(2), pages 347-354, August.
    3. Venkatesh Bala & Sanjeev Goyal, 2000. "A Noncooperative Model of Network Formation," Econometrica, Econometric Society, vol. 68(5), pages 1181-1230, September.
    4. Jong-Shin Wei, 2008. "Having Fun with Organized Kissing: A Pedagogical Note," International Journal of Business and Economics, School of Management Development, Feng Chia University, Taichung, Taiwan, vol. 7(1), pages 53-59, April.
    Full references (including those not matched with items on IDEAS)

    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. Eunae Yoo & Elliot Rabinovich & Bin Gu, 2020. "The Growth of Follower Networks on Social Media Platforms for Humanitarian Operations," Production and Operations Management, Production and Operations Management Society, vol. 29(12), pages 2696-2715, December.
    2. Rajgopal Kannan & Lydia Ray & Sudipta Sarangi, 2007. "The structure of information networks," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 30(1), pages 119-134, January.
    3. Finneran, Lisa & Kelly, Morgan, 2003. "Social networks and inequality," Journal of Urban Economics, Elsevier, vol. 53(2), pages 282-299, March.
    4. Liu, Xiaodong & Patacchini, Eleonora & Zenou, Yves & Lee, Lung-Fei, 2011. "Criminal Networks: Who is the Key Player?," Research Papers in Economics 2011:7, Stockholm University, Department of Economics.
    5. Bich, Philippe & Teteryatnikova, Mariya, 2023. "On perfect pairwise stable networks," Journal of Economic Theory, Elsevier, vol. 207(C).
    6. Sofia Priazhkina & Samuel Palmer & Pablo Martín-Ramiro & Román Orús & Samuel Mugel & Vladimir Skavysh, 2024. "Digital Payments in Firm Networks: Theory of Adoption and Quantum Algorithm," Staff Working Papers 24-17, Bank of Canada.
    7. Grabisch, Michel & Rusinowska, Agnieszka, 2011. "Influence functions, followers and command games," Games and Economic Behavior, Elsevier, vol. 72(1), pages 123-138, May.
    8. Baumann, Leonie, 2021. "A model of weighted network formation," Theoretical Economics, Econometric Society, vol. 16(1), January.
    9. Falk Armin & Kosfeld Michael, 2012. "It's all about Connections: Evidence on Network Formation," Review of Network Economics, De Gruyter, vol. 11(3), pages 1-36, September.
    10. Ugo Bolletta & Luca Paolo Merlino, 2022. "Marriage Through Friends," Dynamic Games and Applications, Springer, vol. 12(4), pages 1046-1066, December.
    11. Péter Bayer & Ani Guerdjikova, 2020. "Optimism leads to optimality: Ambiguity in network formation," Working Papers hal-03005107, HAL.
    12. Berninghaus, Siegfried K. & Ehrhart, Karl-Martin & Ott, Marion, 2008. "Myopically Forward-Looking Agents in a Network Formation Game: Theory and Experimental Evidence," Sonderforschungsbereich 504 Publications 08-02, Sonderforschungsbereich 504, Universität Mannheim;Sonderforschungsbereich 504, University of Mannheim.
    13. Deroian, F., 2009. "Endogenous link strength in directed communication networks," Mathematical Social Sciences, Elsevier, vol. 57(1), pages 110-116, January.
    14. Bravard, Christophe & Charroin, Liza & Touati, Corinne, 2017. "Optimal design and defense of networks under link attacks," Journal of Mathematical Economics, Elsevier, vol. 68(C), pages 62-79.
    15. Javier Rivas, 2009. "Friendship selection," International Journal of Game Theory, Springer;Game Theory Society, vol. 38(4), pages 521-538, November.
    16. Beal, Sylvain & Querou, Nicolas, 2007. "Bounded rationality and repeated network formation," Mathematical Social Sciences, Elsevier, vol. 54(1), pages 71-89, July.
    17. Sanjeev Goyal & Adrien Vigier, 2014. "Attack, Defence, and Contagion in Networks," Review of Economic Studies, Oxford University Press, vol. 81(4), pages 1518-1542.
    18. Britta Hoyer & Kris De Jaegher, 2023. "Network disruption and the common-enemy effect," International Journal of Game Theory, Springer;Game Theory Society, vol. 52(1), pages 117-155, March.
    19. Gaonkar, Shweta & Mele, Angelo, 2023. "A model of inter-organizational network formation," Journal of Economic Behavior & Organization, Elsevier, vol. 214(C), pages 82-104.
    20. Ana Babus, 2016. "The formation of financial networks," RAND Journal of Economics, RAND Corporation, vol. 47(2), pages 239-272, May.

    More about this item

    Statistics

    Access and download statistics

    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:wly:soecon:v:80:y:2014:i:3:p:855-865. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)2325-8012 .

    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.