Opting Into Optimal Matchings

DOI10.1137/1.9781611974782.155zbMath1410.05160arXiv1609.04051OpenAlexW2522899342MaRDI QIDQ4575903

Ioannis Caragiannis, Nika Haghtalab, Rohit Vaish, Ariel D. Procaccia, Eviatar B. Procaccia, Avrim L. Blum

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Games involving graphs (91A43) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Matching models (91B68)

Related Items (3)

Identifying optimal strategies in kidney exchange games is \(\varSigma_2^p\)-complete ⋮ Adapting a kidney exchange algorithm to align with human values ⋮ A theoretical and computational equilibria analysis of a multi-player kidney exchange program

This page was built for publication: Opting Into Optimal Matchings