• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • Tagged with
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Competitions and Delegations on Network Games: Applications in Supply Chain and Project Management

Tao Jiang (5929844) 16 January 2019 (has links)
<div>We consider the models of sequential games over supply chain networks and production chain networks. In the supply chain model, we show that in particular, for series-parallel networks, there is a unique equilibrium. </div><div>We provide a polynomial time algorithm to compute the equilibrium and study the impact of the network structure to the total trade flow at equilibrium. Our results shed light on the trade-off between competition, production cost, and double marginalization. </div><div><br></div><div>In the production chain model, we investigated sequential decisions and delegation options over three agents, chain, and tree networks. Our main contribution is showing the value of delegation and how to maximumly leverage the middleman's aligned interests with the principal. In particular, we provide a polynomial time algorithm to find the optimal delegation structure and the corresponding necessary contract payments for the principal. Furthermore, we analyzed the trade-off of the delegation and gave a deeper insight into the value of delegation in different conditions. Several questions are left for future research such as what's the optimal delegation structures in general tree and how to build the model that agents can try multiple times until the task is successful. </div>
2

Essays in forward looking behavior in strategic interactions

Mantovani, Marco 09 May 2013 (has links)
The general topic of our thesis is forward looking behavior in strategic situations. Mixing theoretical and experimental analysis, we document how strategic thinking is affected by the specific features of a dynamic interaction. The overarching result is that the information regarding decisions that are close to the current one, receive a qualitatively different consideration, with respect to distant ones. That is, the actual decisions are based on reasoning over a limited number of steps, close to actual decison node. We capture this feature of behavior both in a strategic (limited backward induction) and in a non-strategic (limited farsightedness) set up, and we identify relevant consequences on the outcome of the interaction, which powerfullly explain many observed experimental regularities.<p>In the first essay, we present a general out-of-equilibrium framework for strategic thinking in sequential games. It assumes the agents to take decisions on restricted game trees, according to their (limited) foresight level, following backward induction. Therefore we talk of limited backward induction (LBI). We test for LBI using a variant of the race game. Our design allows to identify restricted game trees and backward reasoning, thus properly disentangling LBI behavior. The results provide strong support in favor of LBI. Most players solve intermediate tasks - i.e. restricted games - without reasoning on the terminal histories. Only a small fraction of subjects play close to equilibrium, and (slow) convergence toward it appears, though only in the base game. An intermediate task keeps the subjects off the equilibrium path longer than in the base game. The results cannot be rationalized using the most popular models of strategic reasoning, let alone equilibrium analysis.<p>In the second essay, a subtle implication of the model is investigated: the sensitivity of the players’ foresight to the accessibility and completeness of the information they have, using a Centipede game. By manipulating the way in which information is provided to subjects, we show that reduced availability of information is sufficient to shift the distribution of take-nodes further from the equilibrium prediction. On the other hand, similar results are obtained in a treatment where reduced availability of information is combined with an attempt to elicit preferences for reciprocity, through the presentation of the centipede as a repeated trust game. Our results could be interpreted as cognitive limitations being more effective than preferences in determining (shifts in) behavior in our experimental centipede. Furthermore our results are at odds with the recent ones in Cox [2012], suggesting caution in generalizing their results. Reducing the availability of information may hamper backward induction or induce myopic behavior, depending on the strategic environment.<p>The third essay consists of an experimental investigation of farsighted versus myopic behavior in network formation. Pairwise stability Jackson and Wolinsky [1996] is the standard stability concept in network formation. It assumes myopic behavior of the agents in the sense that they do not forecast how others might react to their actions. Assuming that agents are perfectly farsighted, related stability concepts have been proposed. We design a simple network formation experiment to test these extreme theories, but find evidence against both of them: the subjects are consistent with an intermediate rule of behavior, which we interpret as a form of limited farsightedness. On aggregate, the selection among multiple pairwise stable networks (and the performance of farsighted stability) crucially depends on the level of farsightedness needed to sustain them, and not on efficiency or cooperative considerations. Individual behavior analysis corroborates this interpretation, and suggests, in general, a low level of farsightedness (around two steps) on the part of the agents. / Doctorat en Sciences économiques et de gestion / info:eu-repo/semantics/nonPublished

Page generated in 0.0555 seconds