10 citations · 39 across the 16 of their papers we have counts for
20 papers
Online Bipartite Matching in the Probe-Commit Model
Allan Borodin, Calum MacRury
We consider the classical online bipartite matching problem in the probe-commit model. In this problem, when an online vertex arrives, its edges must be probed to determine if they…
Any-Order Online Interval Selection
Allan Borodin, Christodoulos Karavasilis
We consider the problem of online interval scheduling on a single machine, where intervals arrive online in an order chosen by an adversary, and the algorithm must output a set of…
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…
Electronic markets with multiple submodular buyers
Allan Borodin, Akash Rakheja
We discuss the problem of setting prices in an electronic market that has more than one buyer. We assume that there are self-interested sellers each selling a distinct item that ha…
An Experimental Study of Algorithms for Online Bipartite Matching
Allan Borodin, Christodoulos Karavasilis, Denis Pankratov
We perform an experimental study of algorithms for online bipartite matching under the known i.i.d. input model with integral types. In the last decade, there has been substantial…