On the Convexity of Step out - Step in Sequencing Games

Marieke Musegaas, Peter Borm, Marieke Quant

Research output: Working paperDiscussion paperOther research output

187 Downloads (Pure)

Abstract

The main result of this paper is the convexity of Step out - Step in (SoSi) sequencing games, a class of relaxed sequencing games first analyzed by Musegaas, Borm, and Quant (2015). The proof makes use of a polynomial time algorithm determining the value and an optimal processing order for an arbitrary coalition in a SoSi sequencing game. In particular, we use that in determining an optimal processing order of a coalition S [ fig, the algorithm can start from the optimal processing order found for coalition S and thus all information on this optimal processing order of S can be used.
Original languageEnglish
Place of PublicationTilburg
PublisherCentER, Center for Economic Research
Number of pages38
Volume2016-043
Publication statusPublished - 17 Nov 2016

Publication series

NameCentER Discussion Paper
Volume2016-043

    Fingerprint

Keywords

  • relaxed sequencing games
  • convexity

Cite this

Musegaas, M., Borm, P., & Quant, M. (2016). On the Convexity of Step out - Step in Sequencing Games. (CentER Discussion Paper; Vol. 2016-043). Tilburg: CentER, Center for Economic Research.