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 20 of 31 for “"Fictitious Play"”.
-
New fictitious play procedure for solving Blotto games
In this thesis, a new fictitious play (FP) procedure is presented to solve two-person zero-sum (TPZS) Blotto games. The FP solution procedure solves TPZS games by assuming that the two players take turns selecting optimal responses to the opponent's strategy observed so far. It is known that FP …
-
Solution technique for constrained games using fictitious play and linear programming, A
Includes bibliographical references.
-
Iterative algorithms for two-person zero-sum games
… Brown proposed an iterative algorithm called fictitious play for solving two-person zero-sum games. Although it is an effective method, the fictitious play algorithm converges slowly to the value of the game. Recently, Gass, Zafra, and Qiu proposed a modification that applies to symmetric …
-
Stochastic Differential Games and Decentralized Control
… is more robust compared to the existing Deep Fictitious Play method. The algorithm presented has been validated through several numerical examples. An analytical solution for linear–quadratic–Gaussian differential games is derived to validate the algorithm for problems where the Deep …
-
Revenue management with customer choice and sellers competition
… to their competitors using Cournot adjustment or fictitious play to study the evolution of the assortment competition and the stability of the equilibria. We provide a simple geometric characterization of the dynamics of fictitious play for 2×2 games that is more complete than previous …
-
Convergence of behaviour rules in iterated matrix games
… some form of learning into the strategies of the players involved in the game. Therefore, I begin with the introduction of some key equilibrium sets - namely the set of Nash Equilibria (NE), the set of correlated equilibria (CE) and the marginal best-response set (MBR). I briefly discuss the …
-
Towards Cooperating in Repeated Interactions Without Repeating Structure
… often in ways that are unanticipated by the players. For example, in Interaction Games, the magnitude of payoffs as well as the structure of these payoffs can differ across encounters. Unfortunately, while there have been many algorithms developed for Repeated Games, there are no known …
-
Convergence in min-max optimization
… min-max optimization. We show that the classic fictitious play dynamic with lexicographic tiebreaking converges quickly for diagonal payoff matrices, partly answering a conjecture by Karlin from 1959. We also show that linear last-iterate convergence rates are possible for the Hamiltonian …
-
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 …
-
DECISION MAKING UNDER UNCERTAINTY IN DYNAMIC MULTI-STAGE ATTACKER-DEFENDER GAMES
… published. The first paper presents a novel fictitious play approach to describe the interactions between the attackers and network administrator along a dynamic game. Multi-objective optimization methodology is used to predict the attacker's best actions at each decision node. The …
-
Fictitious Mean-field Reinforcement Learning for Distributed Load Balancing
… algorithm, combining mean-field Q-learning and fictitious play. Through rigorous experiments, we show that our algorithm outperforms naive deployment of single-agent RL, and in some cases, performs comparably to the Nash Q-learning, while being less complex in terms of memory and computation. We …
-
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 …
-
An Iterative Linear Programming Approach to Solving Large Cumulative Search-Evasion Games
… search-evasion games (CSEGs) involve two players, a searcher and an evader, who move among some finite set of cells. Neither player is aware of the other player's position during any stage of the game. When the payoff for the game is assumed to be the number of times the searcher and …
-
PERFORMANCE AND ANALYSIS OF SPOT TRUCK-LOAD PROCUREMENT MARKETS USING SEQUENTIAL AUCTIONS
… are studied; reinforcement learning and fictitious play implementations are discussed. The performance of different auction formats is studied. Simulated scenarios are presented and their results discussed.
-
VGC-bench : towards mastering diverse team strategies in competitive Pokémon
… evaluation protocols, and supplies human-play datasets and a range of baselines -- from large-language-model agents and behavior cloning to reinforcement learning and empirical game-theoretic methods such as self-play, fictitious play, and double oracle. In the restricted setting where an …
-
A game theoretic approach to nuclear safeguards selection and optimization
… to generate a scenario payoff. Using a modified fictitious play algorithm, the game iteratively calls the simulation model until the equilibrium is reached and outputs the optimal inspection strategy, proliferation strategy, and the equilibrium scenario payoff. Two types of attackers are modeled: …
-
Fluctuations and large deviationsin game theoretical models
… game theoretical models with a large number of players. Specifically, I study the strategy distributions in a large game that models how agents choose among double auction markets. I provide a classification of the possible mean field Nash equilibria, which include potentially segregated states …
-
Dynamic interactions in economics: from micro-level games to macroeconomic agent-based models
… — (i) a microeconomic model of agents repeatedly playing normal-form games and (ii) a large-scale multi-country macroeconomic model. On the microeconomic level, we provide novel results on the likelihood of convergence of best-response dynamics, under which each player selects the pure strategy …
Page 1 of 2