Step out-step in sequencing games

Marieke Musegaas, Peter Borm, Marieke Quant

Research output: Contribution to journalArticleScientificpeer-review

12 Citations (Scopus)


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
Original languageEnglish
Pages (from-to)894 - 906
Number of pages12
JournalEuropean Journal of Operational Research
Issue number3
Publication statusPublished - 1 Nov 2015


  • (Cooperative) game theory
  • Sequencing games
  • Core


Dive into the research topics of 'Step out-step in sequencing games'. Together they form a unique fingerprint.

Cite this