Paper Search Console

Home Search Page About Contact

Journal Title

Title of Journal: Math Program

Search In Journal Title:

Abbravation: Mathematical Programming

Search In Journal Abbravation:

Publisher

Springer Berlin Heidelberg

Search In Publisher:

DOI

10.1007/bf00570892

Search In DOI:

ISSN

1436-4646

Search In ISSN:
Search In Title Of Papers:

Nash equilibria in the twoplayer kidney exchange

Authors: Margarida Carvalho Andrea Lodi João Pedro Pedroso Ana Viana
Publish Date: 2016/04/21
Volume: 161, Issue: 1-2, Pages: 389-417
PDF Link

Abstract

Kidney exchange programs have been set in several countries within national regional or hospital frameworks to increase the possibility of kidney patients being transplanted For the case of hospital programs it has been claimed that hospitals would benefit if they collaborated with each other sharing their internal pools and allowing transplants involving patients of different hospitals This claim led to the study of multihospital exchange markets We propose a novel direction in this setting by modeling the exchange market as an integer programming game The analysis of the strategic behavior of the entities participating in the kidney exchange game allowed us to prove that the most rational game outcome maximizes the social welfare and that it can be computed in polynomial timeWe are indebted with Nicolás StierMoses for reading a preliminary version of the paper and providing useful feedbacks This work was partially supported by national funds through Fundação para a Ciência e a Tecnologia FCT within projects PTDC/IIMGES/2830/ 2014 mKEP Models and optimisation algorithms for multicountry kidney exchange programs The first author acknowledges the support of Fundação para a Ciência e a Tecnologia FCT through a PhD grant number SFRH/BD/79201/2011 POPH/FSE program The second author acknowledges the support of MIUR under the PRIN2012 grant We would like to thank the anonymous referees for their valuable comments that significantly contributed to the improvement of this work

Keywords:

References

.
Search In Abstract Of Papers:
Other Papers In This Journal:
  1. Submodular maximization meets streaming: matchings, matroids, and more
  2. Some computationally relevant group theoretic structures of fixed charge problems
  3. Applications of convex analysis within mathematics
  4. Large-scale semidefinite programs in electronic structure calculation
  5. A distributionally robust perspective on uncertainty quantification and chance constrained programming
  6. The factorization approach to large-scale linear programming
  7. Beyond symmetric Broyden for updating quadratic models in minimization without derivatives
  8. A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables
  9. Breakpoint searching algorithms for the continuous quadratic knapsack problem
  10. Sandwich games
  11. Approximations of Nash equilibria
  12. Using cuts for mixed integer knapsack sets to generate cuts for mixed integer polyhedral conic sets
  13. A robust and efficient method for solving point distance problems by homotopy
  14. A nonmonotone GRASP
  15. Extreme point inequalities and geometry of the rank sparsity ball
  16. Primal-dual interior-point methods for PDE-constrained optimization
  17. A new branch-and-cut algorithm for the capacitated vehicle routing problem
  18. Single item lot-sizing with non-decreasing capacities
  19. Structural and algorithmic properties for parametric minimum cuts
  20. Simple integer recourse models: convexity and convex approximations
  21. A model of the coNP-complete non-Hamilton tour decision problem for directed graphs
  22. Iteration complexity analysis of block coordinate descent methods
  23. Error Bounds of Regularized Gap Functions for Nonsmooth Variational Inequality Problems
  24. Accelerating the cubic regularization of Newton’s method on convex problems
  25. Bundle methods for sum-functions with “easy” components: applications to multicommodity network design
  26. On the number of solutions to the linear comple-mentarity problem
  27. Time-consistent approximations of risk-averse multistage stochastic optimization problems
  28. PEBBL: an object-oriented framework for scalable parallel branch and bound
  29. PEBBL: an object-oriented framework for scalable parallel branch and bound
  30. The capacitated max k -cut problem
  31. Critical extreme points of the 2-edge connected spanning subgraph polytope
  32. On some properties and an application of the logarithmic barrier method
  33. Complementarity systems in optimization
  34. On the exact separation of mixed integer knapsack cuts
  35. Analysis of infeasible-interior-point paths arising with semidefinite linear complementarity problems
Search Result: