A polynomial-time algorithm to find von Neumann-Morgenstern stable matchings in marriage games (Q1959733): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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-010-9388-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1969897216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The exchange-stable marriage problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Von Neumann-Morgenstern stable sets in matching problems / 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: Some remarks on the stable matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995616 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Equilibrium-Point Interpretation of Stable Sets and a Proposed Alternative Definition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable marriage assignment for unequal sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lattice fixed-point theorem with constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subsolutions and the Supercore of Cooperative Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999327 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cores and indivisibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5821521 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:54, 3 July 2024

scientific article
Language Label Description Also known as
English
A polynomial-time algorithm to find von Neumann-Morgenstern stable matchings in marriage games
scientific article

    Statements

    A polynomial-time algorithm to find von Neumann-Morgenstern stable matchings in marriage games (English)
    0 references
    0 references
    0 references
    7 October 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    matching problem
    0 references
    stable matching
    0 references
    von Neumann-Morgenstern stable set
    0 references
    0 references