On the Convexity of Step out - Step in Sequencing Games

Marieke Musegaas, Peter Borm, Marieke Quant

Research output: Working paperDiscussion paperOther research output

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.
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

Processing
Polynomials

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.
Musegaas, Marieke ; Borm, Peter ; Quant, Marieke. / On the Convexity of Step out - Step in Sequencing Games. Tilburg : CentER, Center for Economic Research, 2016. (CentER Discussion Paper).
@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 = "11",
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",

}

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

On the Convexity of Step out - Step in Sequencing Games. / Musegaas, Marieke; Borm, Peter; Quant, Marieke.

Tilburg : CentER, Center for Economic Research, 2016. (CentER Discussion Paper; Vol. 2016-043).

Research output: Working paperDiscussion paperOther research output

TY - UNPB

T1 - On the Convexity of Step out - Step in Sequencing Games

AU - Musegaas, Marieke

AU - Borm, Peter

AU - Quant, Marieke

PY - 2016/11/17

Y1 - 2016/11/17

N2 - 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.

AB - 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.

KW - relaxed sequencing games

KW - convexity

M3 - Discussion paper

VL - 2016-043

T3 - CentER Discussion Paper

BT - On the Convexity of Step out - Step in Sequencing Games

PB - CentER, Center for Economic Research

CY - Tilburg

ER -

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