Consistency and characterization of the core of two-sided matching problems (Q1183707): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: College Admissions and the Stability of Marriage / rank
 
Normal rank
Property / cites work
 
Property / cites work: The tracing procedure: A Bayesian approach to defining a solution for n- person noncooperative games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4130997 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999334 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Bargaining Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An axiomatization of the core of cooperative games without side payments / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the reduced game property and its converse / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999327 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0022-0531(92)90078-v / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2085973367 / rank
 
Normal rank

Latest revision as of 10:22, 30 July 2024

scientific article
Language Label Description Also known as
English
Consistency and characterization of the core of two-sided matching problems
scientific article

    Statements

    Consistency and characterization of the core of two-sided matching problems (English)
    0 references
    0 references
    0 references
    28 June 1992
    0 references
    core
    0 references
    two-sided matching
    0 references

    Identifiers