Identifying optimal strategies in kidney exchange games is \(\varSigma_2^p\)-complete

DOI10.1007/s10107-021-01748-6OpenAlexW4206700142MaRDI QIDQ6120903

Bart Smeulders, Frits C. R. Spieksma, D. A. M. P. Blom

Publication date: 21 February 2024

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-021-01748-6

zbMATH Keywords

computational complexityStackelberg gameskidney exchange programmes\(\varSigma_2^p\)

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Hierarchical games (including Stackelberg games) (91A65)

Cites Work

• Bilevel programming and the separation problem
• Nash equilibria in the two-player kidney exchange game
• An improved 2-agent kidney exchange mechanism
• Mix and match: a strategyproof mechanism for multi-hospital kidney exchange
• Design and analysis of multi-hospital kidney exchange mechanisms using random graphs
• TWO THEOREMS IN GRAPH THEORY
• Opting Into Optimal Matchings
• Free riding and participation in large scale, multi-hospital kidney exchange
• Computational Complexity

This page was built for publication: Identifying optimal strategies in kidney exchange games is \(\varSigma_2^p\)-complete