Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 6 of 6 for “"Matching Polytope"”.

  1. Theory and algorithms for matching problems under preferences

    Matching under preferences involves matching agents to one another, subject to various optimality criteria such as stability, popularity, and Pareto-optimality, etc. Each agent expresses ordinal preferences over a subset of the others. Real-life applications include assigning graduating medical …

    texas Repository record for Theory and algorithms for matching problems under preferences (opens in a new tab)

  2. On The Circuit Diameters of Some Combinatorial Polytopes

    The combinatorial diameter of a polytope P is the maximum value of a shortest path between two vertices of P, where the path uses the edges of P only. In contrast to the combinatorial diameter, the circuit diameter of P is defined as the maximum value of a shortest path between two vertices of P, …

    waterloo Repository record for On The Circuit Diameters of Some Combinatorial Polytopes (opens in a new tab)

  3. Lower Bounds for Interactive Compression and Linear Programs

    … Approximate Extended Formulations for the Matching Polytope. We prove a tight lower bound for approximate extended formulations for the Matching polytope. In the course of proving this lower bound, we also obtain a tight non-negative rank lower bound for a family of matrices known as …

    washington Repository record for Lower Bounds for Interactive Compression and Linear Programs (opens in a new tab)

  4. Online Decision-Making in a Randomized Environment: Stochastic Matching and Adaptive Random Graph Processes

    … we consider an online version of the stochastic matching problem. The stochastic matching problem is a generalization of the classical maximal matching problem in which the edges are associated with known edge probabilities which model their likelihood of existing. The algorithm must probe …

    toronto-retro Repository record for Online Decision-Making in a Randomized Environment: Stochastic Matching and Adaptive Random Graph Processes (opens in a new tab)

  5. Fairness and Uncertainty in Graph Matching

    Graph matching is a fundamental computational problem with a broad range of applications across different domains, including resource allocation, e-commerce, kidney exchange, ad placement, and ride-sharing. While the classical maximum matching problem is well-understood, many real-world …

    maryland Repository record for Fairness and Uncertainty in Graph Matching (opens in a new tab)

  6. A Comprehensive Analysis of Lift-and-Project Methods for Combinatorial Optimization

    … \frac{3}{2}$ iterations to compute the matching polytope of the $(2n+1)$-clique. We further prove that the operator requires approximately $\frac{n}{2}$ iterations to reach the stable set polytope of the $n$-clique, if we start with the fractional stable set polytope. Moreover, we …

    waterloo Repository record for A Comprehensive Analysis of Lift-and-Project Methods for Combinatorial Optimization (opens in a new tab)