Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 8 of 8 for “"Fictitious Play"”.
-
A counter-example to Karlin's strong conjecture for fictitious play
Fictitious play is a natural dynamic for equilibrium play in zero-sum games, proposed by Brown , and shown to converge by Robinson . Samuel Karlin conjectured in 1959 that fictitious play converges at rate O(t- 1/ 2) with respect to the number of steps t. We disprove this conjecture by showing …
-
Essays in Decision Theory
… The last chapter deals with a variant model of fictitious play, in which each player has a perturbation term that measures to what extent his rival will stick to the rules of traditional fictitious play. I find that the empirical distribution can converge to a pure Nash equilibrium if the …
-
Defense against network attacks using game theory
… repeated complete-information games is that each player has complete knowledge of the adversary’s payoffs. This assumption is unrealistic when the adversaries are the defense system and the attacker. We employ a Fictitious-Play approach in order to remove this restriction.
-
Game theoretic analysis and design for network security
… from regular connections. We also study two-player classical and stochastic fictitious play processes which can be viewed as sequences of nonzero-sum matrix games between an Attacker and a Defender. Players do not have access to each other's payoff matrix. Each has to observe the other's …
-
Multi-Player Zero-Sum Markov Games with Networked Separable Interactions
We study a new class of Markov games, (multi-player) zero-sum Markov Games with Networked separable interactions (zero-sum NMGs), to model the local interaction structure in non-cooperative multi-agent sequential decision-making. We define a zero-sum NMG as a model where the payoffs of the …
-
Essays on Service Operations with Strategic Customers and Innovative Business Models
… class of learning rules---which includes both fictitious play and Cournot best-response---that converges to herding in finite time. By combining different theoretical and numerical analyses, we find that the herding behavior is prevalent in many other congested open-routing service networks, …
-
Dynamic strategic interactions : analysis and mechanism design
… conflicts between the interests of the players. We make this intuition precise by studying the properties of these two components, and establish that indeed they have quite distinct and remarkable characteristics. The decomposition also allows us to approximate a given game with a …
-
Analysis and design of competing double auction marketplaces
… strategy.<br/><br/>Building on this, we use fictitious play (a computational learning approach) to extend the above analysis by considering continuous trader types, different trading environments and different good properties. Moreover, we consider two more types of fees (transaction and …