Rejection-proof mechanisms for multi-agent kidney exchange
From MaRDI portal
Publication:6188665
DOI10.1016/j.geb.2023.10.015zbMath1530.91429OpenAlexW4388924682MaRDI QIDQ6188665
Bart Smeulders, Danny Blom, Frits C. R. Spieksma
Publication date: 11 January 2024
Published in: Games and Economic Behavior (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.geb.2023.10.015
Applications of mathematical programming (90C90) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Matching models (91B68)
Cites Work
- Bilevel programming and the separation problem
- Altruistically unbalanced kidney exchange
- Nash equilibria in the two-player kidney exchange game
- Pairwise kidney exchange
- The polynomial-time hierarchy
- The trouble with the second quantifier
- IP solutions for international kidney exchange programmes
- A theoretical and computational equilibria analysis of a multi-player kidney exchange program
- A framework for generalized Benders' decomposition and its application to multilevel optimization
- Computing equilibria for integer programming games
- A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation
- Mix and match: a strategyproof mechanism for multi-hospital kidney exchange
- Improved instance generation for kidney exchange programmes
- Kidney Exchange
- The polynomial hierarchy and a simple model for competitive analysis
- Free riding and participation in large scale, multi-hospital kidney exchange
- A Value-Function-Based Exact Approach for the Bilevel Mixed-Integer Programming Problem
- Two-Level Linear Programming
- The Mixed Integer Linear Bilevel Programming Problem
- Computational Complexity
- A survey on bilevel optimization under uncertainty
- A survey on mixed-integer programming techniques in bilevel optimization
This page was built for publication: Rejection-proof mechanisms for multi-agent kidney exchange
