193 citations · 416 across the 36 of their papers we have counts for
10 papers · 1 filter
Stability in stochastic hypergraph matching III: general reneging
Doan Dai Nguyen, Ana Bušić
In many real-life matching problems, waiting agents might abandon before being matched, such as patients deceasing before receiving organs, passengers/drivers cancelling ride reque…
Stability in stochastic hypergraph matching II: weights, batch arrivals, and continuous time
Doan Dai Nguyen, Ana Bušić
Many real-life systems can be found as examples of stochastic matching on hypergraphs, such as production lines or assemble-to-order systems. Two common features are the number of…
On the sub-additivity of stochastic matching
Pascal Moyal, Ana Busic, Jean Mairesse
We consider a stochastic matching model with a general compatibility graph, as introduced in \cite{MaiMoy16}. We prove that most common matching policies (including FCFM, prioritie…
Explicit Mean-Square Error Bounds for Monte-Carlo and Linear Stochastic Approximation
Shuhang Chen, Adithya M. Devraj, Ana Bušić +1
This paper concerns error bounds for recursive equations subject to Markovian disturbances. Motivating examples abound within the fields of Markov chain Monte Carlo (MCMC) and Rein…
Loynes construction for the extended bipartite matching
Pascal Moyal, Ana Busic, Jean Mairesse
We propose an explicit construction of the stationary state of Extended Bipartite Matching (EBM) models, as defined in (Busic et. al., 2013). We use a Loynes-type backwards scheme…
A product form for the general stochastic matching model
Pascal Moyal, Ana Busic, Jean Mairesse
We consider a stochastic matching model with a general compatibility graph, as introduced in \cite{MaiMoy16}. We show that the natural necessary condition of stability of the syste…
Reversibility and further properties of FCFS infinite bipartite matching
Ivo Adan, Ana Busic, Jean Mairesse +1
The model of FCFS infinite bipartite matching was introduced in caldentey-kaplan-weiss 2009. In this model there is a sequence of items that are chosen i.i.d. from $\mathcal{C}=\{c…
Exact Simulation for Assemble-To-Order Systems
Ana Bušić, Emilie Coupechoux
We develop exact simulation (also known as perfect sampling) algorithms for a family of assemble-to-order systems. Due to the finite capacity, and coupling in demands and replenish…
Density classification on infinite lattices and trees
Ana Busic, Nazim Fates, Jean Mairesse +1
Consider an infinite graph with nodes initially labeled by independent Bernoulli random variables of parameter p. We address the density classification problem, that is, we want to…
Probabilistic cellular automata, invariant measures, and perfect sampling
Ana Busic, Jean Mairesse, Irene Marcovici
A probabilistic cellular automaton (PCA) can be viewed as a Markov chain. The cells are updated synchronously and independently, according to a distribution depending on a finite n…