Stable Matching Games: Manipulation via Subgraph Isomorphism

DOI10.4230/LIPIcs.FSTTCS.2016.29zbMath1391.68053OpenAlexW2573776965MaRDI QIDQ4636576

Sanjukta Roy, Sushmita Gupta

Publication date: 19 April 2018

Full work available at URL: http://dblp.uni-trier.de/db/conf/fsttcs/fsttcs2016.html#GuptaR16

zbMATH Keywords

stable matchingsubgraph isomorphismGale-Shapley algorithmsuitor graphexact-exponential-time algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Applications of game theory (91A80) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Matching models (91B68)

This page was built for publication: Stable Matching Games: Manipulation via Subgraph Isomorphism