Characterization of cores of assignment games (Q805509): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Thomas Quint / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Milan Mareš / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every finite distributive lattice is a set of stable matchings / 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: Q4130997 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The assignment game. I: The core / rank
 
Normal rank

Latest revision as of 17:32, 21 June 2024

scientific article
Language Label Description Also known as
English
Characterization of cores of assignment games
scientific article

    Statements

    Characterization of cores of assignment games (English)
    0 references
    0 references
    1991
    0 references
    The assignment or marriage game is a coalition game whose players are divided into two groups and in which only two-players disjoint coalitions which are elements of the Cartesian product of the two groups are admitted. It is shown in the paper under review that the core of such games is always a special type of lattice and, on the other hand, every lattice of the considered type is the core of some assignment game.
    0 references
    0 references
    assignment
    0 references
    marriage game
    0 references
    core
    0 references
    0 references
    0 references