Local Matching Dynamics in Social Networks

DOI10.1007/978-3-642-22012-8_8zbMath1334.91062OpenAlexW35132320MaRDI QIDQ3012913

Martin Hoefer

Publication date: 7 July 2011

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22012-8_8

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Social networks; opinion dynamics (91D30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Matching models (91B68)

Related Items (4)

Analysis of stochastic matching markets ⋮ Network Creation Games: Think Global – Act Local ⋮ Maximum locally stable matchings ⋮ On the convergence of swap dynamics to Pareto-optimal matchings

Cites Work

• Unnamed Item
• Unnamed Item
• On the complexity of distributed stable matching with small messages
• Pairwise kidney exchange
• On-line algorithms for weighted bipartite matching and stable marriages
• A sublinear parallel algorithm for stable matching
• Almost stable matchings by truncating the Gale-Shapley algorithm
• Instability of matchings in decentralized markets with various preference structures
• Uncoordinated Two-Sided Matching Markets
• Random Paths to Stability in Two-Sided Matching
• The Stable Roommates Problem with Globally Ranked Pairs
• Contribution Games in Social Networks
• Job Matching, Coalition Formation, and Gross Substitutes
• A Fixed-Point Approach to Stable Matchings and Some Applications
• College Admissions and the Stability of Marriage

This page was built for publication: Local Matching Dynamics in Social Networks