IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v61y2005i3p501-504.html
   My bibliography  Save this article

Drop out monotonic rules for sequencing situations

Author

Listed:
  • Cristina Fernández
  • Peter Borm
  • Ruud Hendrickx
  • Stef Tijs

Abstract

This note introduces a new monotonicity property for sequencing situations. A sequencing rule is called drop out monotonic if no player will be worse off whenever one of the players decides to drop out of the queue before processing starts. This intuitively appealing property turns out to be very strong: we show that there is at most one rule satisfying both stability and drop out monotonicity. For the standard model of linear cost functions, the existence of this rule is established. Copyright Springer-Verlag 2005

Suggested Citation

  • Cristina Fernández & Peter Borm & Ruud Hendrickx & Stef Tijs, 2005. "Drop out monotonic rules for sequencing situations," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 61(3), pages 501-504, July.
    • Handle: RePEc:spr:mathme:v:61:y:2005:i:3:p:501-504
    DOI: 10.1007/s001860400413
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s001860400413
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s001860400413?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 look for a different version below or search for a different version of it.

    Other versions of this item:

    References listed on IDEAS

    as
    1. Sprumont, Yves, 1990. "Population monotonic allocation schemes for cooperative games with transferable utility," Games and Economic Behavior, Elsevier, vol. 2(4), pages 378-394, December.
    2. Curiel, I. & Pederzoli, G. & Tijs, S.H., 1989. "Sequencing games," Other publications TiSEM cd695be5-0f54-4548-a952-2, Tilburg University, School of Economics and Management.
    3. S. C. Littlechild & G. Owen, 1973. "A Simple Expression for the Shapley Value in a Special Case," Management Science, INFORMS, vol. 20(3), pages 370-372, November.
    4. Curiel, Imma & Pederzoli, Giorgio & Tijs, Stef, 1989. "Sequencing games," European Journal of Operational Research, Elsevier, vol. 40(3), pages 344-351, June.
    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. Herings, P. Jean-Jacques & van der Laan, Gerard & Talman, Dolf, 2007. "The socially stable core in structured transferable utility games," Games and Economic Behavior, Elsevier, vol. 59(1), pages 85-104, April.
    2. Fragnelli, V. & Llorca, N. & Sánchez-Soriano, J. & Tijs, S.H., 2006. "Convex Games with Countable Number of Players and Sequencing Situations," Other publications TiSEM 1140b489-9c79-4920-9dea-6, Tilburg University, School of Economics and Management.
    3. Brânzei, R. & Solymosi, T. & Tijs, S.H., 2003. "Type Monotonic Allocation Schemes for Multi-Glove Games," Discussion Paper 2003-34, Tilburg University, Center for Economic Research.
    4. René Brink & Gerard Laan & Valeri Vasil’ev, 2007. "Component efficient solutions in line-graph games with applications," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 33(2), pages 349-364, November.
    5. Encarnacion Algaba & Rene van den Brink, 2021. "Networks, Communication and Hierarchy: Applications to Cooperative Games," Tinbergen Institute Discussion Papers 21-019/IV, Tinbergen Institute.
    6. Rodica Brânzei & Tamás Solymosi & Stef Tijs, 2007. "Type monotonic allocation schemes for a class of market games," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 15(1), pages 78-88, July.

    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. Brânzei, R. & Dimitrov, D.A. & Tijs, S.H., 2002. "Convex Fuzzy Games and Participation Monotonic Allocation Schemes," Discussion Paper 2002-13, Tilburg University, Center for Economic Research.
    2. Peter Borm & Herbert Hamers & Ruud Hendrickx, 2001. "Operations research games: A survey," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 9(2), pages 139-199, December.
    3. René Brink & Yukihiko Funaki & Yuan Ju, 2013. "Reconciling marginalism with egalitarianism: consistency, monotonicity, and implementation of egalitarian Shapley values," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 40(3), pages 693-714, March.
    4. Habis, Helga, 2012. "Sztochasztikus csődjátékok - avagy hogyan osszunk szét egy bizonytalan méretű tortát? [Stochastic bankruptcy games. How can a cake of uncertain dimensions be divided?]," Közgazdasági Szemle (Economic Review - monthly of the Hungarian Academy of Sciences), Közgazdasági Szemle Alapítvány (Economic Review Foundation), vol. 0(12), pages 1299-1310.
    5. Hamers, H.J.M. & Miquel, S. & Norde, H.W., 2011. "Monotonic Stable Solutions for Minimum Coloring Games," Discussion Paper 2011-016, Tilburg University, Center for Economic Research.
    6. Arantza Estévez-Fernández & Peter Borm & Pedro Calleja & Herbert Hamers, 2008. "Sequencing games with repeated players," Annals of Operations Research, Springer, vol. 158(1), pages 189-203, February.
    7. M. Álvarez-Mozos & R. Brink & G. Laan & O. Tejada, 2017. "From hierarchies to levels: new solutions for games with hierarchical structure," International Journal of Game Theory, Springer;Game Theory Society, vol. 46(4), pages 1089-1113, November.
    8. Stef Tijs & Gert-Jan Otten, 1993. "Compromise values in cooperative game theory," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 1(1), pages 1-36, December.
    9. Voorneveld, Mark & Grahn, Sofia, 2001. "A Minimal Test for Convex Games and the Shapley Value," Working Paper Series 2001:2, Uppsala University, Department of Economics.
    10. Csóka, Péter & Jean-Jacques Herings, P. & Kóczy, László Á. & Pintér, Miklós, 2011. "Convex and exact games with non-transferable utility," European Journal of Operational Research, Elsevier, vol. 209(1), pages 57-62, February.
    11. Hendrickx, R.L.P. & Borm, P.E.M. & Timmer, J.B., 2000. "On Convexity for NTU-Games," Discussion Paper 2000-108, Tilburg University, Center for Economic Research.
    12. Flip Klijn & Stef Tijs & Marco Slikker, 2001. "A Dual Egalitarian Solution," Economics Bulletin, AccessEcon, vol. 3(10), pages 1-8.
    13. Rodica Brânzei & Vito Fragnelli & Stef Tijs, 2002. "Tree-connected peer group situations and peer group games," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 55(1), pages 93-106, March.
    14. René van den Brink & Gerard van der Laan & Valeri Vasil'ev, 2007. "Distributing Dividends in Games with Ordered Players," Tinbergen Institute Discussion Papers 06-114/1, Tinbergen Institute.
    15. Hamers, Herbert, 1997. "On the concavity of delivery games," European Journal of Operational Research, Elsevier, vol. 99(2), pages 445-458, June.
    16. René van den Brink & Gerard van der Laan & Valeri Vasil'ev, 0000. "The Restricted Core for Totally Positive Games with Ordered Players," Tinbergen Institute Discussion Papers 09-038/1, Tinbergen Institute.
    17. René Brink & René Levínský & Miroslav Zelený, 2015. "On proper Shapley values for monotone TU-games," International Journal of Game Theory, Springer;Game Theory Society, vol. 44(2), pages 449-471, May.
    18. Zhao, Jingang, 1999. "A necessary and sufficient condition for the convexity in oligopoly games," Mathematical Social Sciences, Elsevier, vol. 37(2), pages 189-204, March.
    19. Jeroen Kuipers & Dries Vermeulen & Mark Voorneveld, 2010. "A generalization of the Shapley–Ichiishi result," International Journal of Game Theory, Springer;Game Theory Society, vol. 39(4), pages 585-602, October.
    20. Mikel Álvarez-Mozos & René van den Brink & Gerard van der Laan & Oriol Tejada, 2015. "From Hierarchies to Levels: New Solutions for Games," Tinbergen Institute Discussion Papers 15-072/II, Tinbergen Institute.

    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:spr:mathme:v:61:y:2005:i:3:p:501-504. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.