Item

On the convexity of step out - Step in sequencing games

Musegaas,Marieke
; 
Borm,Peter
; 
Quant,Marieke
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 et al. (Eur J Oper Res 246:894–906, 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, the algorithm can start from the optimal processing order found for any subcoalition of smaller size and thus all information on such an optimal processing order can be used.
Description
Date
2018-04
Journal Title
Journal ISSN
Volume Title
Publisher
Collections
Tilburg University Research Output Collection
Show all metadata
Research Projects
Organizational Units
Journal Issue
Keywords
(Cooperative) game theory, relaxed sequencing games, convexity, C71 - Cooperative Games, C44 - Operations Research ; Statistical Decision Theory
Citation
Musegaas, M, Borm, P & Quant, M 2018, 'On the convexity of step out - Step in sequencing games', Top, vol. 26, no. 1, pp. 68-109. https://doi.org/10.1007/s11750-017-0455-2
URI
https://hdl.handle.net/20.500.14602/69571
License
info:eu-repo/semantics/openAccess
Embedded videos