On the Convexity of Step out - Step in Sequencing Games

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

On the Convexity of Step out - Step in Sequencing Games

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

Decentralization and mutual liability rules

This paper builds on the recent work of Groote Schaarsberg et al. (Math Methods Oper Res 87(3):383–409, 2018) on mutual liability problems. In essence, a mutual liability problem comprises a financial network in which agents may have both monetary individual assets and mutual liabilities. Here, mutual liabilities reflect rightful monetary obligations from past bilateral transactions. To settle these liabilities by reallocating the individual assets, mutual liability rules are analyzed that are based on centralized bilateral transfer schemes which use a certain bankruptcy rule as its leading allocation mechanism. In this paper we derive a new characterization of mutual liability rules by taking a decentralized approach instead, which is based on a recursive individual settlement procedure. We show that for bankruptcy rules that satisfy composition, this decentralized procedure always leads to the same allocation as the one prescribed by the corresponding mutual liability rule based on centralized bilateral transfer schemes. Finally, we introduce a new reduction method for mutual liability problems and prove that any bankruptcy-rule-based mutual liability rule is invariant with respect to such a reduction

Begeleiden en beoordelen van ontwerpgericht onderzoek in studio’s = Supervising and assessing design-based research in studios

In het vernieuwde vak “Educational Design Research (EDR)” van de universitaire lerarenopleiding, Master Educatie in de Bètawetenschappen werken studenten samen volgens de cyclus van EDR (McKeeney & Reeves, 2019) rondom thema’s die leven in scholen uit ons netwerk. Uit een verkennende fase, waarin praktijk en literatuur centraal staan, volgen eerste ontwerpprincipes. Het ontwerp wordt ontwikkeld en verantwoord. Ten behoeve van de implementatie en evaluatie wordt een plan gemaakt. Uit de implementatie en evaluatie volgt een eindverslag. Deze groepsproducten leiden tot een groepscijfer. Daarnaast hebben we in ons ontwerp van EDR een werkwijze ontwikkeld rondom de persoonlijke ontwikkeling van de studenten, die uiteindelijk meeweegt in de bepaling van het individuele cijfer. In deze Ontmoeting werken we aan de hand van het wereldcafé aan het bespreken van deze werkwijze; de manier waarop studiobegeleiders zowel begeleider als beoordelaar zijn; en de rol van studenten en scholen in dit geheel. Ieder onderwerp van discussie wordt aan de hand van drie opeenvolgende vragen besproken: knelpunten, oplossingen, randvoorwaarden. De opbrengst gaat in op het (door)ontwikkelen van dit proces. Daarnaast willen we andere lerarenopleidingen ondersteunen die met vergelijkbare processen werken en leren van/met deze ervaringen

ISSN 0924-7815Characterizations of solutions in digraph

competition

On the Convexity of Step out - Step in Sequencing Games

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