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

On the balancedness of relaxed sequencing games

Author

Listed:
  • Bas van Velzen
  • Herbert Hamers

Abstract

This paper shows that some classes of relaxed sequencing games, which arise from the class of sequencing games as introduced in Curiel, Pederzoli, Tijs (1989), are balanced. Copyright Springer-Verlag Berlin Heidelberg 2003

Suggested Citation

  • 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.
    • Handle: RePEc:spr:mathme:v:57:y:2003:i:2:p:287-297
    DOI: 10.1007/s001860200243
    as

    Download full text from publisher

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

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    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. Hendrickx, R.L.P., 2004. "Cooperation and allocation," Other publications TiSEM ab33e762-204c-46e2-86b1-0, Tilburg University, School of Economics and Management.
    3. Musegaas, M. & Borm, P.E.M. & Quant, M., 2015. "Step out–Step in sequencing games," European Journal of Operational Research, Elsevier, vol. 246(3), pages 894-906.
    4. van Velzen, S. & Hamers, H.J.M. & Norde, H.W., 2005. "A Note on Permutationally Convex Games," Discussion Paper 2005-83, Tilburg University, Center for Economic Research.
    5. Trudeau, Christian, 2009. "Network flow problems and permutationally concave games," Mathematical Social Sciences, Elsevier, vol. 58(1), pages 121-131, July.
    6. Calleja, P. & Estevez Fernandez, M.A. & Borm, P.E.M. & Hamers, H.J.M., 2004. "Job Scheduling, Cooperation and Control," Other publications TiSEM 05906ac6-b582-4ee7-875e-9, Tilburg University, School of Economics and Management.
    7. 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.
    8. Gerichhausen, M. & Hamers, H.J.M., 2007. "Partitioning Sequencing Situations and Games," Discussion Paper 2007-40, Tilburg University, Center for Economic Research.
    9. 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.
    10. Atay, Ata & Calleja, Pedro & Soteras, Sergio, 2021. "Open shop scheduling games," European Journal of Operational Research, Elsevier, vol. 295(1), pages 12-21.
    11. Slikker, Marco, 2023. "The stable gain splitting rule for sequencing situations," European Journal of Operational Research, Elsevier, vol. 310(2), pages 902-913.
    12. 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.
    13. van Velzen, S. & Hamers, H.J.M. & Norde, H.W., 2005. "A Note on Permutationally Convex Games," Other publications TiSEM eaa5e42b-9096-4a59-9cfd-0, Tilburg University, School of Economics and Management.
    14. Marco Slikker, 2006. "Relaxed sequencing games have a nonempty core," Naval Research Logistics (NRL), John Wiley & Sons, vol. 53(4), pages 235-242, June.
    15. 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.
    16. van Velzen, S., 2005. "Cooperation in Networks and Scheduling," Other publications TiSEM 81d927bb-fc40-4306-8f7f-a, Tilburg University, School of Economics and Management.

    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:57:y:2003:i:2:p:287-297. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.