Almost stable matchings by truncating the Gale-Shapley algorithm (Q1959728): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q57540239 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-009-9353-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2004854811 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation and Online Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of heuristics for the weighted matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Size Versus Stability in the Marriage Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Distributed Approximations in Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Instability of matchings in decentralized markets with various preference structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sublinear parallel algorithm for stable matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fixed-Point Approach to Stable Matchings and Some Applications / 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: Q3995616 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250185 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysing local algorithms in location-aware quasi-unit-disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Distributed Weighted Matchings on Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line algorithms for weighted bipartite matching and stable marriages / rank
 
Normal rank
Property / cites work
 
Property / cites work: The price of being near-sighted / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locality in Distributed Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: High Performance Computing - HiPC 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: What Can be Computed Locally? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Paths to Stability in Two-Sided Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Survey of local algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The average performance of a parallel stable mariage algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parallel algorithm to solve the stable marriage problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Weighted Matching / rank
 
Normal rank

Latest revision as of 07:54, 3 July 2024

scientific article
Language Label Description Also known as
English
Almost stable matchings by truncating the Gale-Shapley algorithm
scientific article

    Statements

    Almost stable matchings by truncating the Gale-Shapley algorithm (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    7 October 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    distributed stable matching
    0 references
    almost stable matching
    0 references
    local algorithms
    0 references
    constant-time randomised algorithms
    0 references
    0 references
    0 references