Integer Programming Approaches to Stochastic Games Arising in Paired Kidney Exchange and Industrial OrganizationDehghanian, Amin (2015) Integer Programming Approaches to Stochastic Games Arising in Paired Kidney Exchange and Industrial Organization. Doctoral Dissertation, University of Pittsburgh. (Unpublished)
AbstractWe investigate three different problems in this dissertation. The first two problems are related to games arising in paired kidney exchange, and the third is rooted in a computational branch of the industrial organization literature. We provide more details on these problems in the following. End-stage renal disease (ESRD), the final stage of chronic kidney disease, is the ninth-leading cause of death in the United States, where it afflicts more than a half million patients, and costs more than forty billion dollars indirect expenses annually. Transplantation is the preferred treatment for ESRD; unfortunately, there is a severe shortage of transplantable kidneys. Consensus stopping games are a class of stochastic games that arises in the context of kidney exchange. Specifically, the problem of finding a socially optimal pure stationary equilibrium of a consensus stopping game is adapted to value a given kidney exchange. However, computational difficulties have limited its applicability. We show that a consensus stopping game may have many pure stationary equilibria, which in turn raises the question of equilibrium selection. Given an objective criterion, we study the problem of finding a best pure stationary equilibrium for the game, which we show to be NP-hard. We characterize the pure stationary equilibria, show that they form an independence system, and develop several families of valid inequalities. We then solve the equilibrium selection problem as a mixed-integer linear program (MILP) by a branch-and-cut approach. Our computational results demonstrate the advantages of our approach over a commercial solver. Industrial organization is an area of economics that studies firms and markets. Currently, a class of stochastic games are adopted to model behaviors of firms in a market. However, inherent challenges in computability of stationary equilibria have restricted its applicability. To overcome this challenge, we develop several characterizations of stationary equilibria for the class of stochastic games. Share
Details
MetricsMonthly Views for the past 3 yearsPlum AnalyticsActions (login required)
|