Efficient stabilization of cooperative matching games (Q526875): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Stabilizing Network Bargaining Games by Blocking Players / rank
 
Normal rank
Property / cites work
 
Property / cites work: Additive approximation for edge-deletion problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mix and match: a strategyproof mechanism for multi-hospital kidney exchange / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shapley meets Shapley / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Cost of Stability in Coalitional Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming: Methods, Uses, Computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Cooperative Game Theory Foundations of Network Bargaining Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3258698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solutions for the stable roommates problem with payments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing solutions for matching games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Stable Fixtures Problem with Payments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding small stabilizers for unstable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved 2-agent kidney exchange mechanism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Aspects of the Core of Combinatorial Optimization Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of some edge deletion problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable outcomes of the roommate game with transferable utility / rank
 
Normal rank
Property / cites work
 
Property / cites work: The nucleon of cooperative games and an algorithm for matching games / 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: Q5520564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5508779 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on an Auction Procedure for a Matching Game in Polynomial Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for the “stable roommates” problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching Games: The Least Core and the Nucleolus / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of unique 2-prover 1-round games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549713 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network bargaining: using approximate blocking sets to stabilize unstable instances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assignment Problems and the Location of Economic Activities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-Deletion NP-Complete Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stabilization through taxation in \(n\)-person games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The node-deletion problem for hereditary properties is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Bargaining Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of vertex packing and independence system polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional matchings and the Edmonds-Gallai theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The assignment game. I: The core / rank
 
Normal rank
Property / cites work
 
Property / cites work: A maximum stable matching for the roommates problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Factorization of Linear Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-Deletion Problems / rank
 
Normal rank

Latest revision as of 19:14, 13 July 2024

scientific article
Language Label Description Also known as
English
Efficient stabilization of cooperative matching games
scientific article

    Statements

    Efficient stabilization of cooperative matching games (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    15 May 2017
    0 references
    cooperative game
    0 references
    core
    0 references
    Gallai-Edmonds decomposition
    0 references
    matching
    0 references
    network bargaining
    0 references
    solution concept
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers