3 citations · 4 across the 2 of their papers we have counts for
8 papers
Prophet Matching Meets Probing with Commitment
Allan Borodin, Calum MacRury, Akash Rakheja
We consider the online stochastic matching problem for bipartite graphs where edges adjacent to an online node must be probed to determine if they exist, based on known edge probab…
Greedy Approaches to Online Stochastic Matching
Allan Borodin, Calum MacRury, Akash Rakheja
Within the context of stochastic probing with commitment, we consider the online stochastic matching problem; that is, the one-sided online bipartite matching problem where edges a…
Hamilton Cycles in the Semi-random Graph Process
Pu Gao, Bogumil Kaminski, Calum MacRury +1
The semi-random graph process is a single player game in which the player is initially presented an empty graph on vertices. In each round, a vertex is presented to the pla…
Bipartite Stochastic Matching: Online, Random Order, and I.I.D. Models
Allan Borodin, Calum MacRury, Akash Rakheja
Within the context of stochastic probing with commitment, we consider the online stochastic matching problem; that is, the one sided online bipartite matching problem where edges a…
Probabilistically Faulty Searching on a Half-Line
Anthony Bonato, Konstantinos Georgiou, Calum MacRury +1
We study -Faulty Search, a variant of the classic cow-path optimization problem, where a unit speed robot searches the half-line (or -ray) for a hidden item. The searcher is…
Localization Game for Random Graphs
Andrzej Dudek, Sean English, Alan Frieze +2
We consider the localization game played on graphs in which a cop tries to determine the exact location of an invisible robber by exploiting distance probes. The corresponding grap…