Two years ago the Faculty of Mathematics and Informatics at Sofia University makes a decision to design a new series of Logo-based courses which make use of the modern technology....
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
Tomas Brazdil, Vaclav Brozek, Kousha Etessami, Ant...
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
We consider the following distributed optimization problem: three agents i = 1, 2, 3 are each presented with a load drawn independently from the same known prior distribution. Then...
We consider a class of networks where n agents need to send their traffic from a given source to a given destination over m identical, non-intersecting, and parallel links. For suc...