On the existence of three-dimensional stable matchings with cyclic preferences (Q5918706): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
description / endescription / en
scientific article; zbMATH DE number 7545294
scientific article; zbMATH DE number 7162547
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1431.91259 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-030-30473-7_22 / rank
 
Normal rank
Property / published in
 
Property / published in: Algorithmic Game Theory / rank
 
Normal rank
Property / publication date
 
4 February 2020
Timestamp+2020-02-04T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 4 February 2020 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://rd.springer.com/content/pdf/10.1007%2F978-3-030-30473-7_22.pdf / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 7162547 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3214230071 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2947370633 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1905.02844 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonexistence of stable threesome matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-sided stable matchings with cyclic preferences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable matchings in three-sided systems with cyclic preferences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence of stable matchings in some three-sided systems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-dimensional stable matching with cyclic preferences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-dimensional matching instances are rich in stable matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable marriage with general preferences / 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: \(d\)-dimensional stable matching with cyclic preferences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two’s Company, Three’s a Crowd: Stable Family and Threesome Roommates Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular stable matching and 3-way kidney transplant / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of three-dimensional stable matchings with cyclic preferences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmics of Matching Under Preferences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-Dimensional Stabl Matching Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-dimensional stable matching with cyclic preferences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Approach to Stable Matching Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Core Stability in Hedonic Coalition Formation / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:18, 29 July 2024

scientific article; zbMATH DE number 7162547
Language Label Description Also known as
English
On the existence of three-dimensional stable matchings with cyclic preferences
scientific article; zbMATH DE number 7162547

    Statements

    On the existence of three-dimensional stable matchings with cyclic preferences (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    21 June 2022
    0 references
    4 February 2020
    0 references
    0 references
    0 references
    stable matching
    0 references
    three-dimensional matching
    0 references
    NP-completeness
    0 references
    0 references
    0 references
    0 references