Thesis (Ph. D.)--Princeton University, 1950. / Author, John F. Nash, Jr. Includes bibliographical references (leaf [27]). Also issued electronically via World Wide Web.

Thesis (Ph. D.)--Ohio State University, 2007. / Title from first page of PDF file. Includes bibliographical references (p. 103-109).

Thesis (Ph. D.)--University of Washington, 2003. / Vita. Includes bibliographical references (leaves 79-83).

Both of the two major components of Game Theory, e.g., the non-cooperative game theory and the cooperative game theory, are becoming more and more closely related to the field of optimization, as the needs to study the analytical properties of games start to rise. The results presented in this thesis illustrate several connections between Optimization and Game Theory, and attempts are made to build a bridge between the cooperative game theory and the non-cooperative game theory, to characterize the co-existence of competition and cooperation in practice. We start by applying the properties of Polymatroid Optimization to the cooperative game theory, and show that both of the joint replenish game and the one warehouse multi retailer game are submodular games. In the next part, we show that the strategies promoting learning from history are convergent under certain conditions. This result can also be viewed as an efficient algorithm to compute the Nash Equilibrium of the game. Because the competitive routing game satisfies the condition, we know that if every user adapts with good enough memory, then asymptotically the system converges to Nash Equilibrium. Therefore, if the decision of cooperation is difficult to reverse, then it can be justified for the farsighted players to use the cost structure in the Nash Equilibrium point to decide if they should cooperate or not, instead of reacting to the immediate consequences as a basis to make decisions. With the optimization tools applied, we are able to show that in parallel network, the social cost and the cost of other players tend to decrease if two players cooperate. Also, the price of anarchy is higher when the flow demand of players are more evenly distributed. Using that structural result, we derive the exact upper bound of the price of anarchy for a given parallel network with fixed number of players. The exact upper bound of the price of anarchy for arbitrary parallel network with given number of players, which is independent to the network structure and parameters, can be derived consequently. / Simai He. / Adviser: Shuzhong Zhang. / Source: Dissertation Abstracts International, Volume: 72-11, Section: B, page: . / Thesis (Ph.D.)--Chinese University of Hong Kong, 2009. / Includes bibliographical references (leaves 97-103). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Electronic reproduction. [Ann Arbor, MI] : ProQuest Information and Learning, [201-] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Abstract also in Chinese.

Thesis (Ph. D.)--Ohio State University, 2006. / Title from first page of PDF file. Includes bibliographical references (p. 152-166).

Any decentralized retail or wholesale system of competing entities requires a benefit sharing arrangement when competing entities collaborate after their demands are realized. For instance, consider a distribution system similar to the observed behavior of independent car dealerships. If a dealership does not have in stock the car requested by a customer, it might consider acquiring it from a competing dealer. Such behavior raises questions about competitive procurement strategies that achieve system optimal outcomes. This dissertation consists of three main bodies of work contained respectively in chapters 2, 3, and 4. In the first work -- chapter 2, we examine a decentralized system that adopts an ex-post agreed transfer payment approach proposed by Anupindi et al. (Manuf. Serv. Oper.Manag. 4(3):349-368, 2001). In particular, we state a set of conditions on cost parameters and distributions that guarantee uniqueness of pure strategy Nash equilibrium. In the second work -- chapter 3, we introduce a multilevel graph framework that links decentralized inventory distribution models as a network of stochastic programming with recourse problems. This framework depicts independent retailers who maximize their individual expected profits, with each retailer independently procuring inventory in the ex-ante stage in response to forecasted demand and anticipated cooperative recourse action of all retailers in the system. The graph framework clarifies the modeling connection between problems in a taxonomy of decentralized inventory distribution models. This unifying perspective links the past work and shades light on future research directions. In the last work -- chapter 4, we examine and recast the biform games modeling framework as two-stage stochastic programming with recourse. Biform games modeling framework addresses two-stage games with competitive first stage and cooperative second stage without ex-ante agreement on profit sharing scheme. The two-stage stochastic programming view of biform games is demonstrated on examples from all the known examples regarding operational decision problems of competing firms from the literature. It allows an “old” mathematical methodology to showcase its versatility in modeling combined competitive and cooperative game options. In short, this dissertation provides important insights, clarifications, and strategic limitations regarding collaborations in decentralized distribution system.

Thesis (Ph. D.)--Ohio State University, 2006. / Title from first page of PDF file. Includes bibliographical references (p. 135-140).

Thesis (Ph. D.)--Ohio State University, 2007. / Title from first page of PDF file. Includes bibliographical references (p. 121-128).

Submitted by Paulo César Coimbra Lisbôa (pc.coimbra@gmail.com) on 2010-11-11T01:39:34Z No. of bitstreams: 1 PhD_Thesis_Coimbra_v1.pdf: 516617 bytes, checksum: c44a6f3efb7c504da91a6f20e0a95b3f (MD5) / Rejected by Andrea Virginio Machado(andrea.machado@fgv.br), reason: Conforme conversamos, peço fazer a alteração para acesso livre. Andrea on 2010-11-11T14:03:11Z (GMT) / Submitted by Paulo César Coimbra Lisbôa (pc.coimbra@gmail.com) on 2010-11-11T14:17:27Z No. of bitstreams: 1 PhD_Thesis_Coimbra_v1.pdf: 516617 bytes, checksum: c44a6f3efb7c504da91a6f20e0a95b3f (MD5) / Approved for entry into archive by Andrea Virginio Machado(andrea.machado@fgv.br) on 2010-11-16T11:21:16Z (GMT) No. of bitstreams: 1 PhD_Thesis_Coimbra_v1.pdf: 516617 bytes, checksum: c44a6f3efb7c504da91a6f20e0a95b3f (MD5) / Made available in DSpace on 2010-11-17T10:49:20Z (GMT). No. of bitstreams: 1 PhD_Thesis_Coimbra_v1.pdf: 516617 bytes, checksum: c44a6f3efb7c504da91a6f20e0a95b3f (MD5) Previous issue date: 2009-11-30 / Contaminação da confiança é um caso especial de incerteza Knightiana ou ambiguidade na qual o tomador de decisões está diante de não apenas uma única distribuição de probabilidades, mas sim de um conjunto de distribuições de probabilidades. A primeira parte desta tese tem o propósito de fornecer uma caracterização da contaminação da confiança e então apresentar um conjunto de axiomas comportamentais simples sob os quais as preferências de um tomador de decisões é representada pela utilidade esperada de Choquet com contaminação da confiança. A segunda parte desta tese apresenta duas aplicações econômicas de contaminação da confiança: a primeira delas generaliza o teorema de existência de equilíbrio de Nash de Dow e Werlang (o que permite apresentar uma solução explícita para o paradoxo segundo o qual os jogadores de um jogo do dilema dos prisioneiros com um número infinito de repetições não agem de acordo com o esperado pelo procedimento da indução retroativa) e a outra estuda o impacto da contaminação da confiança na escolha de portfolio. / Contamination of confidence is a special case of Knightian uncertainty or ambiguity in which the decision maker faces not simple probability measure but a set of probability measures. The first part of this thesis has the purpose to provide a characterization of the contamination of confidence and then present a simple set of behavioral axioms under which the decision maker’s preference is represented by the Choquet expected utility with contamination of confidence. The second part of this thesis presents two economic applications of the contamination of confidence: the first of them generalizes Dow and Werlang’s existence Theorem of Nash equilibrium under uncertainty (which enables to present an explicit solution to the paradox on which players in a finitely repeated prisoners’ dilemma breaks down backward induction) and the other studies the impact of the contamination of confidence in the portfolio choice.