Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Flora Spieksma"'
Publikováno v:
ICGA Journal. 44:2-17
Combinatorial game theory provides results for the class of two-player, deterministic games with perfect information. With the aim of generalizing this theory to the class of non-perfect information games in mind, we introduce and analyze three varia
Publikováno v:
Bhulai, S, Blok, H & Spieksma, F 2019, ' K competing queues with customer abandonment: optimality of a generalised c mu-rule by the Smoothed Rate Truncation method ', Annals of Operations Research, vol. 317, no. 2, pp. 387-416 . https://doi.org/10.1007/s10479-019-03131-3
Annals of Operations Research, 317(2), 387-416. Springer Netherlands
Annals of Operations Research, 317(2), 387-416. Springer Netherlands
We 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 $$ c μ -rule. To derive a similar rule for the system with aba
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f91bc339509edf68bca73e665fe3b3f4
https://hdl.handle.net/1871.1/f9bdb709-6dc2-4c79-a36c-d6efd247f5be
https://hdl.handle.net/1871.1/f9bdb709-6dc2-4c79-a36c-d6efd247f5be
Autor:
H. Blok, Flora Spieksma
Publikováno v:
Adv. in Appl. Probab. 47, no. 4 (2015), 1088-1107
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 i
Publikováno v:
Communications in Computer and Information Science ISBN: 9783319674674
BNCAI
BNCAI
We examine the cooperative card game Hanabi. Players can only see the cards of the other players, but not their own. Using hints partial information can be revealed. We show some combinatorial properties, and develop AI (Artificial Intelligence) play
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::49fca9bfed767f739defcd030c004bdb
https://doi.org/10.1007/978-3-319-67468-1_7
https://doi.org/10.1007/978-3-319-67468-1_7
Publikováno v:
Probability in the Engineering and Informational Sciences. 22:163-189
In this article we will derive some results for characterizing the almost closed sets of a face-homogeneous random walk. We will present a conjecture on the relation between discrete scattering of the fluid limit and the absence of nonatomic almost c
Autor:
Sandjai Bhulai, Flora Spieksma
Publikováno v:
Bhulai, S & Spieksma, F M 2003, ' On the uniqueness of solutions to the Poisson equations for average cost Markov chains with unbounded cost functions ', Mathematical Methods of Operations Research, vol. 58, pp. 221-236 . https://doi.org/10.1007/s001860300292
Mathematical Methods of Operations Research, 58, 221-236. Physica-Verlag
Mathematical Methods of Operations Research, 58, 221-236. Physica-Verlag
We consider the Poisson equations for denumerable Markov chains with unbounded cost functions. Solutions to the Poisson equations exist in the Banach space of bounded real-valued functions with respect to a weighted supremum norm such that the Markov
Publikováno v:
Queueing Systems, 76(4), 425-446. Springer Netherlands
Bhulai, S, Brooms, A C & Spieksma, F M 2014, ' On structural properties of the value function for an unbounded jump Markov process with an application to a processor-sharing retrial queue ', Queueing Systems, vol. 76, no. 4, pp. 425-446 . https://doi.org/10.1007/s11134-013-9371-9
Bhulai, S, Brooms, A C & Spieksma, F M 2014, ' On structural properties of the value function for an unbounded jump Markov process with an application to a processor-sharing retrial queue ', Queueing Systems, vol. 76, no. 4, pp. 425-446 . https://doi.org/10.1007/s11134-013-9371-9
The derivation of structural properties for unbounded jump Markov processes cannot be done using standard mathematical tools, since the analysis is hindered due to the fact that the system is not uniformizable. We present a promising technique, a smo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::02d5719203aecbfe3b624738e6080a21
https://research.vu.nl/en/publications/4e0e7075-900f-458b-9077-3dfa81af82e7
https://research.vu.nl/en/publications/4e0e7075-900f-458b-9077-3dfa81af82e7
Autor:
Flora Spieksma, Arie Hordijk
Publikováno v:
Advances in Applied Probability. 24:343-376
This paper gives an overview of recurrence and ergodicity properties of a Markov chain. Two new notions for ergodicity and recurrence are introduced. They are called μ -geometric ergodicity and μ -geometric recurrence respectively. The first condit
Publikováno v:
Journal of Mathematical Analysis and Applications, 336(1), 18-30
In this note we characterize regular perturbations of finite state Markov chains in terms of continuity properties of its fundamental matrix. A perturbation turns out to be regular if and only if the fundamental matrix can be approximated by the disc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3cca8333d48835609c268dbadb7fb32f
https://hdl.handle.net/1959.8/48025
https://hdl.handle.net/1959.8/48025