A polynomial-time algorithm for a stable matching problem with linear valuations and bounded side payments (Q933267): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable matching in a common generalization of the marriage and assignment models / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general two-sided matching market with discrete concave utility functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Two-Sided Discrete-Concave Market with Possibly Bounded Side Payments: An Approach by Discrete Convex Analysis / 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: The central assignment game and the assignment markets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexity and Steinitz's exchange property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete convex analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: The assignment game. I: The core / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence of stable outcomes and the lattice property for a unified matching market / rank
 
Normal rank

Latest revision as of 13:33, 28 June 2024

scientific article
Language Label Description Also known as
English
A polynomial-time algorithm for a stable matching problem with linear valuations and bounded side payments
scientific article

    Statements