@techreport{f8a803f51f6a4ac4b4f670e0ba254979,
title = "On the Convexity of Step out - Step in Sequencing Games",
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.",
keywords = "relaxed sequencing games, convexity",
author = "Marieke Musegaas and Peter Borm and Marieke Quant",
year = "2016",
month = nov,
day = "17",
language = "English",
volume = "2016-043",
series = "CentER Discussion Paper",
publisher = "CentER, Center for Economic Research",
type = "WorkingPaper",
institution = "CentER, Center for Economic Research",
}