Please use this identifier to cite or link to this item:
Learning in inventory competition games
|Zeinalzadeh_Ashkan_EMBARGO.pdf||Embargoed (No access)||1.07 MB||Adobe PDF||View/Open|
|Title:||Learning in inventory competition games|
|Issue Date:||May 2013|
|Publisher:||[Honolulu] : [University of Hawaii at Manoa], [May 2013]|
|Abstract:||In a noncooperative game with rational players, Nash strategies are one of the strategies that players can agree on, because none of the players are willing to impose damage to the competitor by lowering their own expected profit. In this dissertation, we incorporate fixed-ordering costs in an inventory competition game; we study the existence of pure Nash equilibrium and behavior of players at Nash equilibrium in a one-period game. We establish the non-existence of pure Nash equilibrium for a large class of multi-period competition games.
In real life, decision-makers are limited in their observations or information about their competitors. In this dissertation, we focus on an imperfect-information competition game in which players do not have any information about their competitors, other than the implicit information encoded in their own observations affected by their competitors' past inventory decisions.
We introduce simple learning algorithms which allow players to make their decisions in a repeated inventory competition. We prove that the inventory decisions generated by the learning algorithms converge, with probability one, to certain threshold values that constitute an equilibrium in pure Markov strategies for the inventory competition game.
|Description:||Ph.D. University of Hawaii at Manoa 2013.|
Includes bibliographical references.
|Appears in Collections:||Ph.D. - Electrical Engineering|
Please contact firstname.lastname@example.org if you need this content in an alternative format.
Items in ScholarSpace are protected by copyright, with all rights reserved, unless otherwise indicated.