Beeson, Coulter and Olver, Neil (2021) A short proof of convexity of step-out–step-in sequencing games. Operations Research Letters, 49 (2). 257 - 259. ISSN 0167-6377
![[img]](http://eprintstest.lse.ac.uk/style/images/fileicons/text.png) |
Text (A Short Proof of Convexity of Step-out Step-in Sequencing Games)
- Accepted Version
Available under License Creative Commons Attribution Non-commercial No Derivatives. Download (248kB) |
Identification Number: https://doi.org/10.1016/j.orl.2021.01.015
Abstract
The Step out–Step in sequencing game is a particular example of a game from the sequencing game framework of Curiel, Perderzoli, and Tijs, where coalitions of players in a queue may reorder themselves to improve the their overall cost, under some restrictions. Musegaas, Borm and Quant proved, in two papers, that a simple greedy algorithm correctly computes the valuation of a coalition, and that the game is convex. These proofs entail rather involved case analyses; in this note, we give short proofs of both results.
| Item Type: | Article |
|---|---|
| Official URL: | https://www.sciencedirect.com/journal/operations-r... |
| Additional Information: | © 2021 Elsevier B.V. |
| Divisions: | Mathematics |
| Subjects: | Q Science > QA Mathematics |
| Date Deposited: | 17 Feb 2021 18:24 |
| Last Modified: | 20 Sep 2025 01:59 |
| URI: | http://eprintstest.lse.ac.uk/id/eprint/108864 |
Actions (login required)
 |
View Item |
