Note on the computational complexity of least core concepts for min-cost spanning tree games Ulrich FaigleWalter KernDaniël Paulusma Pages: 23 - 38
Ideal equilibria in noncooperative multicriteria games Mark VoorneveldSofia GrahnMartin Dufwenberg Pages: 65 - 77
General batch service disciplines – A product-form batch processing network with customer coalescence Sonja Peterson Pages: 79 - 97
Upper bound on the number of processors for scheduling with interprocessor communication delays Aziz Moukrim Pages: 99 - 113
Analysing sojourn times in queueing networks: A structural approach Bernd Heidergott Pages: 115 - 132
Nearly optimal policies in risk-sensitive positive dynamic programming on discrete spaces Rolando Cavazos-CadenaRaúl Montes-de-Oca Pages: 133 - 167
