IDEAS home Printed from https://ideas.repec.org/a/hin/complx/1532013.html
   My bibliography  Save this article

Incremental Bilateral Preference Stable Planning over Event Based Social Networks

Author

Listed:
  • Boyang Li
  • Yurong Cheng
  • Guoren Wang
  • Yongjiao Sun

Abstract

In recent years, Event Based Social Networks (EBSNs) appear in people’s daily life and are becoming increasing popular. In EBSNs, one typical task is to make personalized plans for users. Existing studies only consider the preference of users. They make plans by selecting interesting events for users. However, for organizers of events, they also would like more high-quality users to participate in their events, which may make the events more exciting. Existing studies are user-centered and ignore the requirement of organizers. What is more, organizers are allowed to modify their events dynamically before they are held. The platforms should be able to dynamically adjust the schedules of users. Therefore, we identify a new Incremental Bilateral Preference Stable Planning (IBPSP) problem over EBSNs and propose several solutions to deal with different situations. We conduct extensive experiments to verify the efficiency and effectiveness of the proposed algorithms.

Suggested Citation

  • Boyang Li & Yurong Cheng & Guoren Wang & Yongjiao Sun, 2019. "Incremental Bilateral Preference Stable Planning over Event Based Social Networks," Complexity, Hindawi, vol. 2019, pages 1-12, April.
    • Handle: RePEc:hin:complx:1532013
    DOI: 10.1155/2019/1532013
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/8503/2019/1532013.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/8503/2019/1532013.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2019/1532013?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. Alvin Roth, 2008. "Deferred acceptance algorithms: history, theory, practice, and open questions," International Journal of Game Theory, Springer;Game Theory Society, vol. 36(3), pages 537-569, March.
    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. Muriel Niederle & Alvin E. Roth, 2009. "The Effects of a Centralized Clearinghouse on Job Placement, Wages, and Hiring Practices," NBER Chapters, in: Studies of Labor Market Intermediation, pages 235-271, National Bureau of Economic Research, Inc.
    2. Itai Ashlagi & Flip Klijn, 2012. "Manipulability in matching markets: conflict and coincidence of interests," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 39(1), pages 23-33, June.
    3. Yokote, Koji, 2021. "Consistency of the doctor-optimal equilibrium price vector in job-matching markets," Journal of Economic Theory, Elsevier, vol. 197(C).
    4. Jiang, Zhishan & Tian, Guoqiang, 2013. "Matching with Couples: Stability and Algorithm," MPRA Paper 57936, University Library of Munich, Germany, revised Jul 2014.
    5. Marianne Bertrand & Emir Kamenica & Jessica Pan, 2015. "Gender Identity and Relative Income within Households," The Quarterly Journal of Economics, President and Fellows of Harvard College, vol. 130(2), pages 571-614.
    6. James Boudreau & Vicki Knoblauch, 2013. "Preferences and the price of stability in matching markets," Theory and Decision, Springer, vol. 74(4), pages 565-589, April.
    7. 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.
    8. Lars Ehlers & Bettina Klaus, 2012. "Strategy-Proofness Makes the Difference : Deferred-Acceptance with Responsive Priorities," Cahiers de recherche 15-2012, Centre interuniversitaire de recherche en économie quantitative, CIREQ.
    9. Hatfield, John William & Kominers, Scott Duke, 2017. "Contract design and stability in many-to-many matching," Games and Economic Behavior, Elsevier, vol. 101(C), pages 78-97.
    10. Alvin E. Roth, 2009. "What Have We Learned from Market Design?," Innovation Policy and the Economy, University of Chicago Press, vol. 9(1), pages 79-112.
    11. Dwenger, Nadja & Kübler, Dorothea & Weizsäcker, Georg, 2014. "Flipping a coin: Theory and evidence," Discussion Papers, Research Unit: Market Behavior SP II 2013-201r, WZB Berlin Social Science Center.
    12. Klijn, Flip & Pais, Joana & Vorsatz, Marc, 2020. "Improving schools through school choice: An experimental study of deferred acceptance," Economics Letters, Elsevier, vol. 186(C).
    13. Andersson, Tommy & Ehlers, Lars, 2016. "Assigning Refugees to Landlords in Sweden: Efficient Stable Maximum Matchings," Working Papers 2016:18, Lund University, Department of Economics, revised 27 Aug 2018.
    14. Nitsan Perach & Uriel Rothblum, 2010. "Incentive compatibility for the stable matching model with an entrance criterion," International Journal of Game Theory, Springer;Game Theory Society, vol. 39(4), pages 657-667, October.
    15. Chen, Yi-Chun & Hu, Gaoji, 2020. "Learning by matching," Theoretical Economics, Econometric Society, vol. 15(1), January.
    16. Ronald Wolthoff, 2010. "Applications and Interviews: A Structural Analysis of Two-Sided Simultaneous Search," 2010 Meeting Papers 114, Society for Economic Dynamics.
    17. Schüssler, Reinhard & Seidel, Christian, 2010. "Gale Shapley auf dem Arbeitsmarkt," EconStor Preprints 55829, ZBW - Leibniz Information Centre for Economics.
    18. Fuhito Kojima & Parag A. Pathak, 2009. "Incentives and Stability in Large Two-Sided Matching Markets," American Economic Review, American Economic Association, vol. 99(3), pages 608-627, June.
    19. Morrill, Thayer & Roth, Alvin E., 2024. "Top trading cycles," Journal of Mathematical Economics, Elsevier, vol. 112(C).
    20. Hulsbergen, Wouter, 2016. "Reducing the role of random numbers in matching algorithms for school admission," MPRA Paper 70374, University Library of Munich, Germany.

    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:hin:complx:1532013. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    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.