Efficient partnership formation in networks

DOI10.3982/TE3453;zbMath1427.91204MaRDI QIDQ5243591

Mihai Manea, Bhaskar Dutta, Francis Bloch

Publication date: 19 November 2019

Published in: Theoretical Economics (Search for Journal in Brave)

Full work available at URL: https://econtheory.org/ojs/index.php/te/article/viewFile/3453/24481/706

zbMATH Keywords

efficiencynetworkspartnershipsmaximum matchingsGallai-Edmonds decompositiondecentralized marketsfavor exchangeunder-demanded

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Games involving graphs (91A43) Matching models (91B68)

Related Items (4)

Decentralized matching at senior-level: stability and incentives ⋮ When partner knows best: asymmetric expertise in partnerships ⋮ Axiomatizations of the \(\beta\) and the score measures in networks ⋮ New Algorithms for Edge Induced König-Egerváry Subgraph Based on Gallai-Edmonds Decomposition

This page was built for publication: Efficient partnership formation in networks