Nash equilibria in the two-player kidney exchange game

DOI10.1007/s10107-016-1013-7zbMath1414.91289OpenAlexW2341168876MaRDI QIDQ507331

Margarida Carvalho, João Pedro Pedroso, Andrea Lodi, Ana Viana

Publication date: 3 February 2017

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

Full work available at URL: https://doi.org/10.1007/s10107-016-1013-7

zbMATH Keywords

matchingNash equilibriumsocial welfarekidney exchange

Mathematics Subject Classification ID

Integer programming (90C10) Games involving graphs (91A43) Graph algorithms (graph-theoretic aspects) (05C85) Matching models (91B68)

Related Items (5)

Identifying optimal strategies in kidney exchange games is \(\varSigma_2^p\)-complete ⋮ Equilibrium modeling and solution approaches inspired by nonconvex bilevel programming ⋮ Rejection-proof mechanisms for multi-agent kidney exchange ⋮ IP solutions for international kidney exchange programmes ⋮ A theoretical and computational equilibria analysis of a multi-player kidney exchange program

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Pareto efficient Nash equilibria in discontinuous games
• Potential games
• An improved 2-agent kidney exchange mechanism
• 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
• Rational Generating Functions and Integer Programming Games
• TWO THEOREMS IN GRAPH THEORY
• Free riding and participation in large scale, multi-hospital kidney exchange
• Paths, Trees, and Flowers
• Algorithmic Game Theory

This page was built for publication: Nash equilibria in the two-player kidney exchange game