The general graph matching game: approximate core

DOI10.1016/j.geb.2022.01.017zbMath1485.91014arXiv2101.07390OpenAlexW4210297752MaRDI QIDQ2078093

Vijay V. Vazirani

Publication date: 25 February 2022

Published in: Games and Economic Behavior (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2101.07390

zbMATH Keywords

coreassignment gameapproximate coreLP-dualitygeneral graph matching gametransferable utility (TU) market

Mathematics Subject Classification ID

Cooperative games (91A12) Games involving graphs (91A43) Matching models (91B68)

Related Items

Population monotonicity in matching games ⋮ Approximate core allocations for edge cover games ⋮ On the population monotonicity of independent set games

Cites Work

• Unnamed Item
• Computing solutions for matching games
• Game theoretic analysis of a bankruptcy problem from the Talmud
• Matching theory
• Geometric algorithms and combinatorial optimization
• The nucleon of cooperative games and an algorithm for matching games
• An algorithm for finding the nucleolus of assignment games
• Stable outcomes of the roommate game with transferable utility
• The assignment game. I: The core
• Strongly essential coalitions and the nucleolus of peer group games
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• Geometric Properties of the Kernel, Nucleolus, and Related Solution Concepts
• Vertex packings: Structural properties and algorithms
• Integer Programming: Methods, Uses, Computations
• The Nucleolus of a Characteristic Function Game
• Matching Games: The Least Core and the Nucleolus
• College Admissions and the Stability of Marriage
• Computing the nucleolus of weighted cooperative matching games in polynomial time