Nash equilibria in the two-player kidney exchange game
From MaRDI portal
Publication:507331
Recommendations
- A theoretical and computational equilibria analysis of a multi-player kidney exchange program
- A bounded-risk mechanism for the kidney exchange game
- A Bounded-Risk Mechanism for the Kidney Exchange Game
- Pareto optimality in the kidney exchange Problem
- Robust Models for the Kidney Exchange Problem
- Short trading cycles: paired kidney exchange with strict ordinal preferences
- On interchangeability of Nash equilibria in multi-player strategic games
- scientific article; zbMATH DE number 1738583
- Equilibrium Allocations Under Alternative Waitlist Designs: Evidence From Deceased Donor Kidneys
Cites work
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- scientific article; zbMATH DE number 5049926 (Why is no real title available?)
- Algorithmic Game Theory
- An improved 2-agent kidney exchange mechanism
- Free riding and participation in large scale, multi-hospital kidney exchange
- Game theory
- Graph theory with applications
- Mix and match: a strategyproof mechanism for multi-hospital kidney exchange
- New insights on integer-programming models for the kidney exchange problem
- Non-cooperative games
- Pareto efficient Nash equilibria in discontinuous games
- Paths, Trees, and Flowers
- Potential games
- Rational generating functions and integer programming games
- TWO THEOREMS IN GRAPH THEORY
Cited in
(6)- IP solutions for international kidney exchange programmes
- A theoretical and computational equilibria analysis of a multi-player kidney exchange program
- Equilibrium modeling and solution approaches inspired by nonconvex bilevel programming
- A Bounded-Risk Mechanism for the Kidney Exchange Game
- Identifying optimal strategies in kidney exchange games is \(\varSigma_2^p\)-complete
- Rejection-proof mechanisms for multi-agent kidney exchange
This page was built for publication: Nash equilibria in the two-player kidney exchange game
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q507331)