Floske M. Spieksma
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Floske M. Spieksma has a total of 28 co-authors. Here are the top co-authors by number of shared publications:
Arie Hordijk
Leiden University
4 shared publicationsA. Hordijk
Department of Mathematics and Computer Science, Leiden University, P.O. Box 9512, 2300 RA Leiden, The Netherlands
3 shared publications- Laurens C. Smit
Mathematisch Instituut, Universiteit Leiden, Niels Bohrweg 1, 2333 CA Leiden, the Netherlands
3 shared publications - Sandjai Bhulai
Vrije Universiteit Amsterdam, Amsterdam, The Netherlands
3 shared publications Eitan Altman
INRIA,BP93 , 2004 Route des Lucioles, Sophia Antipolis, 06902, France
2 shared publicationsMichael N. Katehakis
2 shared publications
Latest Publications
- 1 December 2025
- Published by Institute of Mathematical Statistics in The Annals of Applied Probability
- Vol. 35 (6) , 4354-4380
Deviation matrix in denumerable Markov processes: Characterisation, rank-one perturbation and restart
We study the deviation matrix of denumerable state space, multi-chain Markov processes in continuous time. The deviation matrix is a measure of the cumulative deviation from the limiting probabilities and it plays an important role in many application domains. First, we provide several equivalent necessary and sufficient conditions for the existence of the deviation matrix. Next, we study a relation between the deviation matrix and rank-one perturbations of Markov processes. Based on a rank-one perturbation, we derive a versatile formula for the deviation matrix and apply this formula to Markov processes with restart. On the way, we needed to establish several new properties of rank-one perturbed Markov processes. We feel that those properties can be useful in their own right.
- 1 December 2025
- Published by Institute of Mathematical Statistics in The Annals of Applied Probability
- Vol. 35 (6) , 4354-4380
Deviation matrix in denumerable Markov processes: Characterisation, rank-one perturbation and restart
We study the deviation matrix of denumerable state space, multi-chain Markov processes in continuous time. The deviation matrix is a measure of the cumulative deviation from the limiting probabilities and it plays an important role in many application domains. First, we provide several equivalent necessary and sufficient conditions for the existence of the deviation matrix. Next, we study a relation between the deviation matrix and rank-one perturbations of Markov processes. Based on a rank-one perturbation, we derive a versatile formula for the deviation matrix and apply this formula to Markov processes with restart. On the way, we needed to establish several new properties of rank-one perturbed Markov processes. We feel that those properties can be useful in their own right.
- 25 July 2022
- Published by Springer Nature in The Mathematical Intelligencer
- Vol. 45 (1) , 88-89
Chance, Logic and Intuition: An Introduction to the Counter-Intuitive Logic of Chance
- 25 July 2022
- Published by Springer Nature in The Mathematical Intelligencer
- Vol. 45 (1) , 88-89
Chance, Logic and Intuition: An Introduction to the Counter-Intuitive Logic of Chance
- Open Access
- 11 January 2019
- Published by Springer Nature in Annals of Operations Research
- Vol. 317 (2) , 387-416
K competing queues with customer abandonment: optimality of a generalised $c \mu $-rule by the Smoothed Rate Truncation methodWe consider a K-competing queues system with the additional feature of customer abandonment. Without abandonment, it is optimal to allocate the server to a queue according to the $$c \mu $$ -rule. To derive a similar rule for the system with abandonment, we model the system as a continuous-time Markov decision process. Due to impatience, the Markov decision process has unbounded jump rates as a function of the state. Hence it is not uniformisable, and so far there has been no systematic direct way to analyse this. The Smoothed Rate Truncation principle is a technique designed to make an unbounded rate process uniformisable, while preserving the properties of interest. Together with theory securing continuity in the limit, this provides a framework to analyse unbounded rate Markov decision processes. With this approach, we have been able to find close-fitting conditions guaranteeing optimality of a strict priority rule.- 11 January 2019
- Published by Springer Nature in Annals of Operations Research
- Vol. 317 (2) , 387-416
Open AccessK competing queues with customer abandonment: optimality of a generalised $c \mu $-rule by the Smoothed Rate Truncation methodWe consider a K-competing queues system with the additional feature of customer abandonment. Without abandonment, it is optimal to allocate the server to a queue according to the $$c \mu $$ -rule. To derive a similar rule for the system with abandonment, we model the system as a continuous-time Markov decision process. Due to impatience, the Markov decision process has unbounded jump rates as a function of the state. Hence it is not uniformisable, and so far there has been no systematic direct way to analyse this. The Smoothed Rate Truncation principle is a technique designed to make an unbounded rate process uniformisable, while preserving the properties of interest. Together with theory securing continuity in the limit, this provides a framework to analyse unbounded rate Markov decision processes. With this approach, we have been able to find close-fitting conditions guaranteeing optimality of a strict priority rule. - Open Access
- 28 December 2018
- Published by Wiley in Naval Research Logistics (NRL)
- Vol. 65 (8) , 638-659
A novel use of value iteration for deriving bounds for threshold and switching curve optimal policies
In this article, we develop a novel role for the initial function v0 in the value iteration algorithm. In case the optimal policy of a countable state Markovian queueing control problem has a threshold or switching curve structure, we conjecture, that one can tune the choice of v0 to generate monotonic sequences of n‐stage threshold or switching curve optimal policies. We will show this for three queueing control models, the M/M/1 queue with admission and with service control, and the two‐competing queues model with quadratic holding cost. As a consequence, we obtain increasingly tighter upper and lower bounds. After a finite number of iterations, either the optimal threshold, or the optimal switching curve values in a finite number of states is available. This procedure can be used to increase numerical efficiency.
- 28 December 2018
- Published by Wiley in Naval Research Logistics (NRL)
- Vol. 65 (8) , 638-659
Open AccessA novel use of value iteration for deriving bounds for threshold and switching curve optimal policies
In this article, we develop a novel role for the initial function v0 in the value iteration algorithm. In case the optimal policy of a countable state Markovian queueing control problem has a threshold or switching curve structure, we conjecture, that one can tune the choice of v0 to generate monotonic sequences of n‐stage threshold or switching curve optimal policies. We will show this for three queueing control models, the M/M/1 queue with admission and with service control, and the two‐competing queues model with quadratic holding cost. As a consequence, we obtain increasingly tighter upper and lower bounds. After a finite number of iterations, either the optimal threshold, or the optimal switching curve values in a finite number of states is available. This procedure can be used to increase numerical efficiency.
- 15 September 2017
- Published by Springer Nature in Communications in Computer and Information Science
- p. 93-105
Aspects of the Cooperative Card Game Hanabi
- 15 September 2017
- Published by Springer Nature in Communications in Computer and Information Science
- p. 93-105
Aspects of the Cooperative Card Game Hanabi
- 24 March 2016
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 53 (1) , 106-120
A comparative analysis of the successive lumping and the lattice path counting algorithms
This paper provides a comparison of the successive lumping (SL) methodology developed in Katehakis et al. (2015) with the popular lattice path counting (Mohanty (1979)) in obtaining rate matrices for queueing models, satisfying the specific quasi birth and death structure as in Van Leeuwaarden et al. (2009) and Van Leeuwaarden and Winands (2006). The two methodologies are compared both in terms of applicability requirements and numerical complexity by analyzing their performance for the same classical queueing models considered in Van Leeuwaarden et al. (2009). The main findings are threefold. First, when both methods are applicable, the SL-based algorithms outperform the lattice path counting algorithm (LPCA). Second, there are important classes of problems (for example, models with (level) nonhomogenous rates or with finite state spaces) for which the SL methodology is applicable and for which the LPCA cannot be used. Third, another main advantage of SL algorithms over lattice path counting is that the former includes a method to compute the steady state distribution using this rate matrix.
- 24 March 2016
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 53 (1) , 106-120
A comparative analysis of the successive lumping and the lattice path counting algorithms
This paper provides a comparison of the successive lumping (SL) methodology developed in Katehakis et al. (2015) with the popular lattice path counting (Mohanty (1979)) in obtaining rate matrices for queueing models, satisfying the specific quasi birth and death structure as in Van Leeuwaarden et al. (2009) and Van Leeuwaarden and Winands (2006). The two methodologies are compared both in terms of applicability requirements and numerical complexity by analyzing their performance for the same classical queueing models considered in Van Leeuwaarden et al. (2009). The main findings are threefold. First, when both methods are applicable, the SL-based algorithms outperform the lattice path counting algorithm (LPCA). Second, there are important classes of problems (for example, models with (level) nonhomogenous rates or with finite state spaces) for which the SL methodology is applicable and for which the LPCA cannot be used. Third, another main advantage of SL algorithms over lattice path counting is that the former includes a method to compute the steady state distribution using this rate matrix.
- 1 December 2015
- Published by Cambridge University Press (CUP) in Advances in Applied Probability
- Vol. 47 (4) , 1088-1107
Countable state Markov decision processes with unbounded jump rates and discounted cost: optimality equation and approximations
This paper considers Markov decision processes (MDPs) with unbounded rates, as a function of state. We are especially interested in studying structural properties of optimal policies and the value function. A common method to derive such properties is by value iteration applied to the uniformised MDP. However, due to the unboundedness of the rates, uniformisation is not possible, and so value iteration cannot be applied in the way we need. To circumvent this, one can perturb the MDP. Then we need two results for the perturbed sequence of MDPs: 1. there exists a unique solution to the discounted cost optimality equation for each perturbation as well as for the original MDP; 2. if the perturbed sequence of MDPs converges in a suitable manner then the associated optimal policies and the value function should converge as well. We can model both the MDP and perturbed MDPs as a collection of parametrised Markov processes. Then both of the results above are essentially implied by certain continuity properties of the process as a function of the parameter. In this paper we deduce tight verifiable conditions that imply the necessary continuity properties. The most important of these conditions are drift conditions that are strongly related to nonexplosiveness.
- 1 December 2015
- Published by Cambridge University Press (CUP) in Advances in Applied Probability
- Vol. 47 (4) , 1088-1107
Countable state Markov decision processes with unbounded jump rates and discounted cost: optimality equation and approximations
This paper considers Markov decision processes (MDPs) with unbounded rates, as a function of state. We are especially interested in studying structural properties of optimal policies and the value function. A common method to derive such properties is by value iteration applied to the uniformised MDP. However, due to the unboundedness of the rates, uniformisation is not possible, and so value iteration cannot be applied in the way we need. To circumvent this, one can perturb the MDP. Then we need two results for the perturbed sequence of MDPs: 1. there exists a unique solution to the discounted cost optimality equation for each perturbation as well as for the original MDP; 2. if the perturbed sequence of MDPs converges in a suitable manner then the associated optimal policies and the value function should converge as well. We can model both the MDP and perturbed MDPs as a collection of parametrised Markov processes. Then both of the results above are essentially implied by certain continuity properties of the process as a function of the parameter. In this paper we deduce tight verifiable conditions that imply the necessary continuity properties. The most important of these conditions are drift conditions that are strongly related to nonexplosiveness.
- Open Access
A Comparative Analysis of the Successive Lumping and the Lattice Path Counting Algorithms
This article provides a comparison of the successive lumping (SL) methodology with the popular lattice path counting algorithm in obtaining rate matrices for queueing models, satisfying the quasi birth and death structure. The two methodologies are compared both in terms of applicability requirements and numerical complexity by analyzing their performance for the same classical queueing models. The main findings are: i) When both methods are applicable SL based algorithms outperform the lattice path counting algorithm (LPCA). ii) There are important classes of problems (e.g., models with (level) non-homogenous rates or with finite state spaces) for which the SL methodology is applicable and for which the LPCA cannot be used. iii) Another main advantage of successive lumping algorithms over LPCAs is that the former includes a method to compute the steady state distribution using this rate matrix.
Open AccessA Comparative Analysis of the Successive Lumping and the Lattice Path Counting Algorithms
This article provides a comparison of the successive lumping (SL) methodology with the popular lattice path counting algorithm in obtaining rate matrices for queueing models, satisfying the quasi birth and death structure. The two methodologies are compared both in terms of applicability requirements and numerical complexity by analyzing their performance for the same classical queueing models. The main findings are: i) When both methods are applicable SL based algorithms outperform the lattice path counting algorithm (LPCA). ii) There are important classes of problems (e.g., models with (level) non-homogenous rates or with finite state spaces) for which the SL methodology is applicable and for which the LPCA cannot be used. iii) Another main advantage of successive lumping algorithms over LPCAs is that the former includes a method to compute the steady state distribution using this rate matrix.
- 1 April 2015
- Published by Cambridge University Press (CUP) in Probability in the Engineering and Informational Sciences
- Vol. 29 (4) , 623-637
COUNTABLE STATE MARKOV PROCESSES: NON-EXPLOSIVENESS AND MOMENT FUNCTION
The existence of a moment function satisfying a drift function condition is well known to guarantee non-explosiveness of the associated minimal Markov process (cf. [1,9]), under standard technical conditions. Surprisingly, the reverse is true as well for a countable space Markov process. We prove this result by showing that recurrence of an associated jump process, that we call the α-jump process, is equivalent to non-explosiveness. Non-explosiveness corresponds in a natural way to the validity of the Kolmogorov integral relation for the function identically equal to 1. In particular, we show that positive recurrence of the α-jump chain implies that all bounded functions satisfy the Kolmogorov integral relation. We present a drift function criterion characterizing positive recurrence of this α-jump chain.Suppose that to a drift functionVthere corresponds another drift functionW, which is a moment with respect toV. Via a transformation argument, the above relations hold for the transformed process with respect toV. Transferring the results back to the original process, allows to characterize theV-bounded functions that satisfy the Kolmogorov forward equation.
- 1 April 2015
- Published by Cambridge University Press (CUP) in Probability in the Engineering and Informational Sciences
- Vol. 29 (4) , 623-637
COUNTABLE STATE MARKOV PROCESSES: NON-EXPLOSIVENESS AND MOMENT FUNCTION
The existence of a moment function satisfying a drift function condition is well known to guarantee non-explosiveness of the associated minimal Markov process (cf. [1,9]), under standard technical conditions. Surprisingly, the reverse is true as well for a countable space Markov process. We prove this result by showing that recurrence of an associated jump process, that we call the α-jump process, is equivalent to non-explosiveness. Non-explosiveness corresponds in a natural way to the validity of the Kolmogorov integral relation for the function identically equal to 1. In particular, we show that positive recurrence of the α-jump chain implies that all bounded functions satisfy the Kolmogorov integral relation. We present a drift function criterion characterizing positive recurrence of this α-jump chain.Suppose that to a drift functionVthere corresponds another drift functionW, which is a moment with respect toV. Via a transformation argument, the above relations hold for the transformed process with respect toV. Transferring the results back to the original process, allows to characterize theV-bounded functions that satisfy the Kolmogorov forward equation.
- 22 December 2014
- Published by Cambridge University Press (CUP) in Probability in the Engineering and Informational Sciences
- Vol. 29 (2) , 191-217
DES AND RES PROCESSES AND THEIR EXPLICIT SOLUTIONS
This paper defines and studies the down entrance state (DES) and the restart entrance state (RES) classes of quasi-skip free (QSF) processes specified in terms of the nonzero structure of the elements of their transition rate matrix Q. A QSF process is a Markov chain with states that can be specified by tuples of the form (m, i), where $m \in {\open Z}$ represents the “current” level of the state and $i \in {\open Z}^{+}$ the current phase of the state, and its transition probability matrix Q does not permit one-step transitions to states that are two or more levels away from the current state in one direction of the level variable m. A QSF process is a DES process if and only if one step “down” transitions from a level m can only reach a single state in level m − 1, for all m. A QSF process is a RES process if and only if one step “up” transitions from a level m can only reach a single set of states in the highest level M2, largest of all m.We derive explicit solutions and simple truncation bounds for the steady-state probabilities of both DES and RES processes, when in addition Q insures ergodicity. DES and RES processes have applications in many areas of applied probability comprising computer science, queueing theory, inventory theory, reliability, and the theory of branching processes. To motivate their applicability we present explicit solutions for the well-known open problem of the M/Er/n queue with batch arrivals, an inventory model, and a reliability model.- 22 December 2014
- Published by Cambridge University Press (CUP) in Probability in the Engineering and Informational Sciences
- Vol. 29 (2) , 191-217
DES AND RES PROCESSES AND THEIR EXPLICIT SOLUTIONS
This paper defines and studies the down entrance state (DES) and the restart entrance state (RES) classes of quasi-skip free (QSF) processes specified in terms of the nonzero structure of the elements of their transition rate matrix Q. A QSF process is a Markov chain with states that can be specified by tuples of the form (m, i), where $m \in {\open Z}$ represents the “current” level of the state and $i \in {\open Z}^{+}$ the current phase of the state, and its transition probability matrix Q does not permit one-step transitions to states that are two or more levels away from the current state in one direction of the level variable m. A QSF process is a DES process if and only if one step “down” transitions from a level m can only reach a single state in level m − 1, for all m. A QSF process is a RES process if and only if one step “up” transitions from a level m can only reach a single set of states in the highest level M2, largest of all m.We derive explicit solutions and simple truncation bounds for the steady-state probabilities of both DES and RES processes, when in addition Q insures ergodicity. DES and RES processes have applications in many areas of applied probability comprising computer science, queueing theory, inventory theory, reliability, and the theory of branching processes. To motivate their applicability we present explicit solutions for the well-known open problem of the M/Er/n queue with batch arrivals, an inventory model, and a reliability model.