Corpus ID: 30004765

Matching with Commitments

  title={Matching with Commitments},
  author={Kevin P. Costello and Prasad Tetali and Pushkar Tripathi},
  • Kevin P. Costello, Prasad Tetali, Pushkar Tripathi
  • Published in ArXiv 2012
  • Mathematics, Computer Science
  • We consider the following stochastic optimization problem first introduced by Chen et al. in \cite{chen}. We are given a vertex set of a random graph where each possible edge is present with probability p_e. We do not know which edges are actually present unless we scan/probe an edge. However whenever we probe an edge and find it to be present, we are constrained to picking the edge and both its end points are deleted from the graph. We wish to find the maximum matching in this model. We… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv