Flos Spieksma

According to our database, Flos Spieksma authored at least 14 papers between 1994 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

Nim variants.

Mark J. H. van den Bergh, Walter A. Kosters, Flora M. Spieksma

J. Int. Comput. Games Assoc., 2022

Stochastic models and algorithms dedicated to the 60th birthday of Professor Eugene A. Feinberg.

Stella Kapodistria, Michael N. Katehakis, Sheldon M. Ross, Floske Spieksma

Ann. Oper. Res., 2022

Probability methods in business and industry in honor of Benjamin Avi-Itzhak and Matthew J. Sobel.

Eugene A. Feinberg, Michael N. Katehakis, Floske Spieksma

Ann. Oper. Res., 2022

K competing queues with customer abandonment: optimality of a generalised c μ-rule by the Smoothed Rate Truncation method.

Sandjai Bhulai, H. Blok, Flora M. Spieksma

Ann. Oper. Res., 2022

2016

A comparative analysis of the successive lumping and the lattice path counting algorithms.

Michael N. Katehakis, Laurens C. Smit, Floske Spieksma

J. Appl. Probab., 2016

Kolmogorov forward equation and explosiveness in countable state Markov processes.

F. M. Spieksma

Ann. Oper. Res., 2016

Aspects of the Cooperative Card Game Hanabi.

Mark J. H. van den Bergh, Anne Hommelberg, Walter A. Kosters, Flora M. Spieksma

Proceedings of the BNAIC 2016: Artificial Intelligence, 2016

2014

On structural properties of the value function for an unbounded jump Markov process with an application to a processor sharing retrial queue.

Sandjai Bhulai, A. C. Brooms, Flora M. Spieksma

Queueing Syst. Theory Appl., 2014

2005

Special issue in honor of Arie Hordijk Editorial introduction.

Lodewijk C. M. Kallenberg, Ger Koole, Flos Spieksma

Math. Methods Oper. Res., 2005

2003

On the uniqueness of solutions to the Poisson equations for average cost Markov chains with unbounded cost functions.

Sandjai Bhulai, Flora M. Spieksma

Math. Methods Oper. Res., 2003

1997

Contraction Conditions for Average and α-Discount Optimality in Countable State Markov Games with Unbounded Rewards.

Eitan Altman, Arie Hordijk, F. M. Spieksma

Math. Oper. Res., 1997

Optimal service control against worst case admission policies: A multichained stochastic game.

Arie Hordijk, Olaf Passchier, Floske Spieksma

Math. Methods Oper. Res., 1997

1995

The Linear Program approach in multi-chain Markov Decision Processes revisited.

Eitan Altman, Flos Spieksma

Math. Methods Oper. Res., 1995

1994

On the Relation Between Recurrence and Ergodicity Properties in Denumerable Markov Decision Chains.

Rommert Dekker, Arie Hordijk, F. M. Spieksma

Math. Oper. Res., 1994