Skip to content

Optimization Online

  • Welcome
  • Repository
  • Submit
  • About
  • Help
  • My Eprints

Stable Matchings for Three-Sided Systems

Published: 2004/02/08, Updated: 2004/03/29
  • Somdeb Lahiri
    • Categories Finance and Economics, Game Theory Tags stable matching, three-sided systems Short URL: https://optimization-online.org/?p=8931

    A sufficient condition is provided for the existence of stable matchings for three sided systems.

    Article

    Download

    View Stable Matchings for Three-Sided Systems

    Post navigation
    A filter-trust-region method for unconstrained optimization
    Batched Bin Packing
    Log in

    Repository

    Author List

    Months

    Categories

    Keywords

    alternating direction method of multipliers approximation algorithms augmented lagrangian method bilevel optimization Branch-and-Bound branch-and-cut chance constraints column generation combinatorial optimization complexity compressed sensing conic optimization convex optimization cutting planes decomposition derivative-free optimization distributionally robust optimization duality dynamic programming first-order methods global convergence global optimization heuristics integer programming interior point methods large-scale optimization linear programming machine learning mixed-integer linear programming mixed-integer nonlinear programming mixed-integer programming nonconvex optimization nonlinear optimization nonlinear programming nonsmooth optimization optimal control optimization proximal point algorithm quadratic programming robust optimization semidefinite programming stochastic optimization stochastic programming trust-region methods unconstrained optimization

    © 2023 Optimization Online • Child Theme of GeneratePress
    For feedback or questions, contact optonline@wid.wisc.edu.