The complexity of matching games: a survey (Q6488787): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Approximation and Online Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stabilizing network bargaining games by blocking players / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shapley meets Shapley / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the Cost of Stabilizing a Cooperative Game / 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: Finding and verifying the nucleolus of cooperative games / 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: Fractional solutions for capacitated NTU-games, with applications to stable matchings / 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: Size versus stability in the marriage problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding small stabilizers for unstable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bribery and Control in Stable Marriage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Aspects of Cooperative Game Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Additive stabilizers for unstable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of constructing solutions in the core based on synergies among coalitions / 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: Maximum matching and a polyhedron with 0,1-vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preference swaps for the stable matching problem / 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: Network Bargaining with General Capacities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3254699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2865888 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coalitional games induced by matching problems: complexity and islands of tractability for the Shapley value / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient stabilization of cooperative matching games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cores of partitioning games / 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: Q3549713 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stabilizing Weighted Graphs / 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: Computing the nucleolus of weighted cooperative matching games in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general framework for computing the nucleolus via dynamic programming / 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: The kernel and bargaining set for convex games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric Properties of the Kernel, Nucleolus, and Related Solution Concepts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex packings: Structural properties and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2805764 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Nucleolus of a Characteristic Function Game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cores of convex games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The assignment game. I: The core / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for finding the nucleolus of assignment games / 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: A Short Proof of the Factor Theorem for Finite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The general graph matching game: approximate core / rank
 
Normal rank
Property / cites work
 
Property / cites work: Another proof that assignment games have singleton cores only if multiple optimal matchings exist / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:59, 3 December 2024

scientific article; zbMATH DE number 7753307
Language Label Description Also known as
English
The complexity of matching games: a survey
scientific article; zbMATH DE number 7753307

    Statements

    The complexity of matching games: a survey (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    23 October 2023
    0 references
    autonomous agents
    0 references
    game theory
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references