Popular matchings with variable item copies (Q631788): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q62045779, #quickstatements; #temporary_batch_1707232231678
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2010.12.067 / 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.1016/j.tcs.2010.12.067 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2094637312 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Popular Matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using clausal graphs to determine the computational complexity of \(k\)-bounded positive one-in-three SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871750 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Unpopularity Matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank-maximal matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The stable marriage problem with master preference lists / rank
 
Normal rank
Property / cites work
 
Property / cites work: Popular Mixed Matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Popular Matchings with Variable Job Capacities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Popular Matchings in the Capacitated House Allocation Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Least-Unpopularity-Factor and Least-Unpopularity-Margin Criteria for Matching Problems with One-Sided Preferences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted Popular Matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak versus strong domination in a market with indivisible goods / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2010.12.067 / rank
 
Normal rank

Latest revision as of 05:37, 9 December 2024

scientific article
Language Label Description Also known as
English
Popular matchings with variable item copies
scientific article

    Statements

    Popular matchings with variable item copies (English)
    0 references
    0 references
    0 references
    14 March 2011
    0 references
    bipartite graphs
    0 references
    matchings
    0 references
    one-sided preference lists
    0 references
    NP-hardness
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references