A lower bound on the average number of Pivot-steps for solving linear programs Valid for all variants of the Simplex-Algorithm Karl Heinz BorgwardtPetra Huhn Pages: 175 - 210
Scheduling identical jobs with chain precedence constraints on two uniform machines Peter BruckerJohann HurinkWieslaw Kubiak Pages: 211 - 219
Time complexity of single- and identical parallel-machine scheduling with GERT network precedence constraints Jürgen Zimmermann Pages: 221 - 238
Vector network equilibrium problems and nonlinear scalarization methods G. Y. ChenC. J. GohX. Q. Yang Pages: 239 - 253
The finiteness of the reward function and the optimal value function in Markov decision processes Qiying HuChen Xu Pages: 255 - 266
Two-person bilateral many-rounds poker Vladimir V. MazalovSvetlana V. PanovaMojca Pis˘kuric˘ Pages: 267 - 282
Repeated games with incomplete information and transportation problems Victor DomanskyVictoria Kreps Pages: 283 - 298
Controlled Markov chains with risk-sensitive criteria: Average cost, optimality equations, and optimal solutions Rolando Cavazos-CadenaEmmanuel Fernández-Gaucherand Pages: 299 - 324
Bounds for a class of stochastic recursive equations Zhen LiuPhilippe NainDon Towsley Pages: 325 - 333
On tail probabilities and first passage times for fractional Brownian motion Zbigniew Michna Pages: 335 - 354