IDEAS home Printed from https://ideas.repec.org/p/hal/journl/hal-02885954.html
   My bibliography  Save this paper

Delegation equilibrium payoffs in integer-splitting games

Author

Listed:
  • Sylvain Sorin

    (IMJ - Institut de Mathématiques de Jussieu - UPMC - Université Pierre et Marie Curie - Paris 6 - UPD7 - Université Paris Diderot - Paris 7 - CNRS - Centre National de la Recherche Scientifique)

  • Cheng Wan

    (IMJ - Institut de Mathématiques de Jussieu - UPMC - Université Pierre et Marie Curie - Paris 6 - UPD7 - Université Paris Diderot - Paris 7 - CNRS - Centre National de la Recherche Scientifique)

Abstract

This work studies a new strategic game called delegation game. A delegation game is associated to a basic game with a finite number of players where each player has a finite integer weight and her strategy consists in dividing it into several integer parts and assigning each part to one subset of finitely many facilities. In the associated delegation game, a player divides her weight into several integer parts, commits each part to an independent delegate and collects the sum of their payoffs in the basic game played by these delegates. Delegation equilibrium payoffs, consistent delegation equilibrium payoffs and consistent chains inducing these ones in a delegation game are defined. Several examples are provided.

Suggested Citation

  • Sylvain Sorin & Cheng Wan, 2013. "Delegation equilibrium payoffs in integer-splitting games," Post-Print hal-02885954, HAL.
    • Handle: RePEc:hal:journl:hal-02885954
    DOI: 10.1051/ro/2013026
    Note: View the original document on HAL open archive server: https://hal.science/hal-02885954
    as

    Download full text from publisher

    File URL: https://hal.science/hal-02885954/document
    Download Restriction: no
    File URL: https://libkey.io/10.1051/ro/2013026?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. Patrick T. Harker, 1988. "Multiple Equilibrium Behaviors on Networks," Transportation Science, INFORMS, vol. 22(1), pages 39-46, February.
    2. Cheng Wan, 2012. "Coalitions in Nonatomic Network Congestion Games," Mathematics of Operations Research, INFORMS, vol. 37(4), pages 654-669, November.
    3. Roberto Cominetti & José R. Correa & Nicolás E. Stier-Moses, 2009. "The Impact of Oligopolistic Competition in Networks," Operations Research, INFORMS, vol. 57(6), pages 1421-1437, December.
    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. Wan, Cheng, 2016. "Strategic decentralization in binary choice composite congestion games," European Journal of Operational Research, Elsevier, vol. 250(2), pages 531-542.
    2. Cheng Wan, 2016. "Strategic decentralization in binary choice composite congestion games," Post-Print hal-02885837, HAL.

    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. Cheng Wan, 2016. "Strategic decentralization in binary choice composite congestion games," Post-Print hal-02885837, HAL.
    2. Wan, Cheng, 2016. "Strategic decentralization in binary choice composite congestion games," European Journal of Operational Research, Elsevier, vol. 250(2), pages 531-542.
    3. Sylvain Sorin & Cheng Wan, 2016. "Finite composite games: Equilibria and dynamics," Post-Print hal-02885860, HAL.
    4. Hugo E. Silva & Robin Lindsey & André de Palma & Vincent A. C. van den Berg, 2017. "On the Existence and Uniqueness of Equilibrium in the Bottleneck Model with Atomic Users," Transportation Science, INFORMS, vol. 51(3), pages 863-881, August.
    5. Umang Bhaskar & Lisa Fleischer & Darrell Hoy & Chien-Chung Huang, 2015. "On the Uniqueness of Equilibrium in Atomic Splittable Routing Games," Mathematics of Operations Research, INFORMS, vol. 40(3), pages 634-654, March.
    6. Cheng Wan, 2012. "Coalitions in Nonatomic Network Congestion Games," Post-Print hal-02885914, HAL.
    7. Cheng Wan, 2012. "Coalitions in Nonatomic Network Congestion Games," Mathematics of Operations Research, INFORMS, vol. 37(4), pages 654-669, November.
    8. Roughgarden, Tim & Schoppmann, Florian, 2015. "Local smoothness and the price of anarchy in splittable congestion games," Journal of Economic Theory, Elsevier, vol. 156(C), pages 317-342.
    9. Feng, Zengzhe & Gao, Ziyou & Sun, Huijun, 2014. "Bounding the inefficiency of atomic splittable selfish traffic equilibria with elastic demands," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 63(C), pages 31-43.
    10. He, Fang & Yin, Yafeng & Shirmohammadi, Nima & Nie, Yu (Marco), 2013. "Tradable credit schemes on networks with mixed equilibrium behaviors," Transportation Research Part B: Methodological, Elsevier, vol. 57(C), pages 47-65.
    11. Tobias Harks & Konstantin Miller, 2011. "The Worst-Case Efficiency of Cost Sharing Methods in Resource Allocation Games," Operations Research, INFORMS, vol. 59(6), pages 1491-1503, December.
    12. E. Nikolova & N. E. Stier-Moses, 2014. "A Mean-Risk Model for the Traffic Assignment Problem with Stochastic Travel Times," Operations Research, INFORMS, vol. 62(2), pages 366-382, April.
    13. Wang, Hua & Meng, Qiang & Zhang, Xiaoning, 2020. "Multiple equilibrium behaviors of auto travellers and a freight carrier under the cordon-based large-truck restriction regulation," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 134(C).
    14. Roberto Cominetti & José R. Correa & Nicolás E. Stier-Moses, 2009. "The Impact of Oligopolistic Competition in Networks," Operations Research, INFORMS, vol. 57(6), pages 1421-1437, December.
    15. Nicole Adler & Eran Hanany & Stef Proost, 2022. "Competition in Congested Service Networks with Application to Air Traffic Control Provision in Europe," Management Science, INFORMS, vol. 68(4), pages 2751-2784, April.
    16. Xia Yang & Xuegang Jeff Ban & Rui Ma, 2017. "Mixed Equilibria with Common Constraints on Transportation Networks," Networks and Spatial Economics, Springer, vol. 17(2), pages 547-579, June.
    17. Naimzada, A.K. & Raimondo, Roberto, 2018. "Heterogeneity and chaos in congestion games," Applied Mathematics and Computation, Elsevier, vol. 335(C), pages 278-291.
    18. Luce Brotcorne & Martine Labbé & Patrice Marcotte & Gilles Savard, 2000. "A Bilevel Model and Solution Algorithm for a Freight Tariff-Setting Problem," Transportation Science, INFORMS, vol. 34(3), pages 289-302, August.
    19. Angelelli, E. & Morandi, V. & Savelsbergh, M. & Speranza, M.G., 2021. "System optimal routing of traffic flows with user constraints using linear programming," European Journal of Operational Research, Elsevier, vol. 293(3), pages 863-879.
    20. Huang, Hai-Jun & Li, Zhi-Chun, 2007. "A multiclass, multicriteria logit-based traffic equilibrium assignment model under ATIS," European Journal of Operational Research, Elsevier, vol. 176(3), pages 1464-1477, February.

    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:hal:journl:hal-02885954. 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: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    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.