IDEAS home Printed from https://ideas.repec.org/p/tiu/tiucen/68089383-0b91-4cc8-9d03-ebc88e1137c3.html
   My bibliography  Save this paper

Step out - Step in Sequencing Games

Author

Listed:
  • Musegaas, M.

    (Tilburg University, Center For Economic Research)

  • Borm, P.E.M.

    (Tilburg University, Center For Economic Research)

  • Quant, M.

    (Tilburg University, Center For Economic Research)

Abstract

In this paper a new class of relaxed sequencing games is introduced: the class of Step out–Step in sequencing games. In this relaxation any player within a coalition is allowed to step out from his position in the processing order and to step in at any position later in the processing order. First, we show that if the value of a coalition in a relaxed sequencing game is bounded from above by the gains made by all possible neighbor switches, then the game has a non-empty core. After that, we show that this is the case for Step out –Step in sequencing games. Moreover, this paper provides a polynomial time algorithm to determine the values of the coalitions in Step out–Step in sequencing games.
(This abstract was borrowed from another version of this item.)

Suggested Citation

  • Musegaas, M. & Borm, P.E.M. & Quant, M., 2014. "Step out - Step in Sequencing Games," Discussion Paper 2014-070, Tilburg University, Center for Economic Research.
  • Handle: RePEc:tiu:tiucen:68089383-0b91-4cc8-9d03-ebc88e1137c3
    as

    Download full text from publisher

    File URL: https://pure.uvt.nl/ws/portalfiles/portal/4560425/2014_070.pdf
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. Gerichhausen, Marloes & Hamers, Herbert, 2009. "Partitioning sequencing situations and games," European Journal of Operational Research, Elsevier, vol. 196(1), pages 207-216, July.
    2. Imma Curiel, 2015. "Compensation rules for multi-stage sequencing games," Annals of Operations Research, Springer, vol. 225(1), pages 65-82, February.
    3. Marco Slikker, 2005. "Balancedness of Sequencing Games with Multiple Parallel Machines," Annals of Operations Research, Springer, vol. 137(1), pages 177-189, July.
    4. S. Alparslan-Gök & R. Branzei & V. Fragnelli & S. Tijs, 2013. "Sequencing interval situations and related games," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 21(1), pages 225-236, January.
    5. Grundel, Soesja & Çiftçi, Barış & Borm, Peter & Hamers, Herbert, 2013. "Family sequencing and cooperation," European Journal of Operational Research, Elsevier, vol. 226(3), pages 414-424.
    6. Curiel, I. & Potters, J.A.M. & Rajendra Prasad, V. & Tijs, S.H. & Veltman, B., 1993. "Cooperation in one machine scheduling," Other publications TiSEM 9c5ceec5-2080-4b5c-98d5-0, Tilburg University, School of Economics and Management.
    7. 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.
    8. Wayne E. Smith, 1956. "Various optimizers for single‐stage production," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 3(1‐2), pages 59-66, March.
    9. Bas van Velzen & Herbert Hamers, 2003. "On the balancedness of relaxed sequencing games," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 57(2), pages 287-297, May.
    10. Flip Klijn & Estela Sánchez, 2006. "Sequencing games without initial order," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 63(1), pages 53-62, February.
    11. Slikker, Marco, 2006. "Balancedness of multiple machine sequencing games revisited," European Journal of Operational Research, Elsevier, vol. 174(3), pages 1944-1949, November.
    12. Marco Slikker, 2006. "Relaxed sequencing games have a nonempty core," Naval Research Logistics (NRL), John Wiley & Sons, vol. 53(4), pages 235-242, June.
    13. Edwin Lohmann & Peter Borm & Marco Slikker, 2014. "Sequencing situations with Just-in-Time arrival, and related games," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 80(3), pages 285-305, December.
    14. 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. Saavedra-Nieves, Alejandro & Schouten, Jop & Borm, Peter, 2020. "On interactive sequencing situations with exponential cost functions," European Journal of Operational Research, Elsevier, vol. 280(1), pages 78-89.
    2. Slikker, Marco, 2023. "The stable gain splitting rule for sequencing situations," European Journal of Operational Research, Elsevier, vol. 310(2), pages 902-913.
    3. Schouten, Jop, 2022. "Cooperation, allocation and strategy in interactive decision-making," Other publications TiSEM d5d41448-8033-4f6b-8ec0-c, Tilburg University, School of Economics and Management.
    4. Schouten, Jop & Saavedra-Nieves, Alejandro & Fiestras-Janeiro, G., 2020. "Sequencing Situations and Games with Non-Linear Cost Functions," Discussion Paper 2020-006, Tilburg University, Center for Economic Research.
    5. M. Musegaas & P. E. M. Borm & M. Quant, 2018. "On the convexity of step out–step in sequencing games," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 26(1), pages 68-109, April.
    6. Ata Atay & Christian Trudeau, 2022. "Queueing games with an endogenous number of machines," Working Papers 2202, University of Windsor, Department of Economics.
    7. Schouten, Jop & Saavedra-Nieves, Alejandro & Fiestras-Janeiro, G., 2020. "Sequencing Situations and Games with Non-Linear Cost Functions," Other publications TiSEM 3e1db5c9-0f77-4f91-a075-c, Tilburg University, School of Economics and Management.
    8. Yang, Guangjing & Sun, Hao & Hou, Dongshuang & Xu, Genjiu, 2019. "Games in sequencing situations with externalities," European Journal of Operational Research, Elsevier, vol. 278(2), pages 699-708.
    9. Atay, Ata & Calleja, Pedro & Soteras, Sergio, 2021. "Open shop scheduling games," European Journal of Operational Research, Elsevier, vol. 295(1), pages 12-21.

    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. Yang, Guangjing & Sun, Hao & Hou, Dongshuang & Xu, Genjiu, 2019. "Games in sequencing situations with externalities," European Journal of Operational Research, Elsevier, vol. 278(2), pages 699-708.
    2. M. Musegaas & P. E. M. Borm & M. Quant, 2018. "On the convexity of step out–step in sequencing games," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 26(1), pages 68-109, April.
    3. Saavedra-Nieves, Alejandro & Schouten, Jop & Borm, Peter, 2020. "On interactive sequencing situations with exponential cost functions," European Journal of Operational Research, Elsevier, vol. 280(1), pages 78-89.
    4. Ciftci, B.B. & Borm, P.E.M. & Hamers, H.J.M. & Slikker, M., 2008. "Batch Sequencing and Cooperation," Other publications TiSEM ed1f8fce-da76-41a6-9a9e-9, Tilburg University, School of Economics and Management.
    5. Gerichhausen, Marloes & Hamers, Herbert, 2009. "Partitioning sequencing situations and games," European Journal of Operational Research, Elsevier, vol. 196(1), pages 207-216, July.
    6. Borm, Peter & Fiestras-Janeiro, Gloria & Hamers, Herbert & Sanchez, Estela & Voorneveld, Mark, 2002. "On the convexity of games corresponding to sequencing situations with due dates," European Journal of Operational Research, Elsevier, vol. 136(3), pages 616-634, February.
    7. Lohmann, E.R.M.A. & Borm, P.E.M. & Slikker, M., 2010. "Preparation Sequencing Situations and Related Games," Discussion Paper 2010-31, Tilburg University, Center for Economic Research.
    8. Gerichhausen, M. & Hamers, H.J.M., 2007. "Partitioning Sequencing Situations and Games," Discussion Paper 2007-40, Tilburg University, Center for Economic Research.
    9. Slikker, Marco, 2023. "The stable gain splitting rule for sequencing situations," European Journal of Operational Research, Elsevier, vol. 310(2), pages 902-913.
    10. Schouten, Jop & Saavedra-Nieves, Alejandro & Fiestras-Janeiro, G., 2020. "Sequencing Situations and Games with Non-Linear Cost Functions," Other publications TiSEM 3e1db5c9-0f77-4f91-a075-c, Tilburg University, School of Economics and Management.
    11. Schouten, Jop & Saavedra-Nieves, Alejandro & Fiestras-Janeiro, G., 2020. "Sequencing Situations and Games with Non-Linear Cost Functions," Discussion Paper 2020-006, Tilburg University, Center for Economic Research.
    12. Marieke Quant & Marc Meertens & Hans Reijnierse, 2008. "Processing games with shared interest," Annals of Operations Research, Springer, vol. 158(1), pages 219-228, February.
    13. van Beek, Andries & Malmberg, Benjamin & Borm, Peter & Quant, Marieke & Schouten, Jop, 2021. "Cooperation and Competition in Linear Production and Sequencing Processes," Discussion Paper 2021-011, Tilburg University, Center for Economic Research.
    14. Ciftci, B.B., 2009. "A cooperative approach to sequencing and connection problems," Other publications TiSEM b0f08a17-4734-4d57-ad66-f, Tilburg University, School of Economics and Management.
    15. Reijnierse, Hans & Borm, Peter & Quant, Marieke & Meertens, Marc, 2010. "Processing games with restricted capacities," European Journal of Operational Research, Elsevier, vol. 202(3), pages 773-780, May.
    16. Gerichhausen, M. & Hamers, H.J.M., 2007. "Partitioning Sequencing Situations and Games," Other publications TiSEM 2bddbf5c-c56d-4b10-ba47-5, Tilburg University, School of Economics and Management.
    17. Moulin, Herve, 2005. "Split-Proof Probabilistic Scheduling," Working Papers 2004-06, Rice University, Department of Economics.
    18. Grundel, Soesja & Çiftçi, Barış & Borm, Peter & Hamers, Herbert, 2013. "Family sequencing and cooperation," European Journal of Operational Research, Elsevier, vol. 226(3), pages 414-424.
    19. Imma Curiel & Herbert Hamers & Stef Tijs & Jos Potters, 1997. "Restricted component additive games," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 45(2), pages 213-220, June.
    20. Debasis Mishra & Bharath Rangarajan, 2007. "Cost sharing in a job scheduling problem," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 29(3), pages 369-382, October.

    More about this item

    Keywords

    cooperative game theory; sequencing games; core;
    All these keywords.

    JEL classification:

    • C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
    • C44 - Mathematical and Quantitative Methods - - Econometric and Statistical Methods: Special Topics - - - Operations Research; Statistical Decision Theory

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:tiu:tiucen:68089383-0b91-4cc8-9d03-ebc88e1137c3. 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: Richard Broekman (email available below). General contact details of provider: http://center.uvt.nl .

    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.