Popular critical matchings in the many-to-many setting (Q6199405): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Stability and Polarization of Interests in Job Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pareto optimality in many-to-many matching problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two problems in max-size popular matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hospitals/residents problem with lower quotas / rank
 
Normal rank
Property / cites work
 
Property / cites work: College Admissions and the Stability of Marriage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly Stable Assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Popular Matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Popular Matchings in the Marriage and Roommates Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Popular matchings in the stable marriage problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Size-Popularity Tradeoff in the Stable Marriage Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Popular edges and dominant matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Popularity in the generalized hospital residents setting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Popular Branchings and Their Dual Certificates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Popularity, Mixed Matchings, and Self-Duality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-popular Matchings, Optimality, and Extended Formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Popular Matchings with Two-Sided Preferences and One-Sided Ties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many-to-one popular matchings with two-sided preferences and one-sided ties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Understanding Popular Matchings via Stable Matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Matroid Approach to Stable Matchings with Lower Quotas / rank
 
Normal rank
Property / cites work
 
Property / cites work: The lattice of envy-free matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Envy-free matchings with lower quotas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Envy-freeness and relaxed stability: hardness and approximation algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable matchings with covering constraints: a complete computational trichotomy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incomplete list setting of the hospitals/residents problem with maximally satisfying lower quotas / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to the maximum-flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3085455 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple push-relabel algorithms for matroids and submodular flows / rank
 
Normal rank

Latest revision as of 12:21, 27 August 2024

scientific article; zbMATH DE number 7809119
Language Label Description Also known as
English
Popular critical matchings in the many-to-many setting
scientific article; zbMATH DE number 7809119

    Statements

    Popular critical matchings in the many-to-many setting (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    23 February 2024
    0 references
    matching
    0 references
    many-to-many
    0 references
    lower quotas
    0 references
    two-sided preferences
    0 references
    popular
    0 references
    critical
    0 references
    0 references
    0 references

    Identifiers