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 16 of 16 for “"Two-player game"”.
-
EXPLORATION OF THE THREE-PLAYER PARTIZAN GAME OF RHOMBINATION
We introduce a new combinatorial three-player partizan game called Rhombination and expand some ideas from two-player game theory into three-player game theory.
-
Single-player to Two-player Knowledge Transfer in Atari 2600 Games
Playing two-player games using reinforcement learning and self-play can be challenging due to the complexity of two-player environments and the potential instability in the training process. It is proposed that a reinforcement learning algorithm can train more efficiently and achieve improved …
-
Belief propagation analysis in two-player games for peer-influence social networks
… the propagation of beliefs in the social network, whereby each agent has a belief and a threshold value, which indicts the willingness to be influenced by the peers. Agents communicate in stochastic pairwise interactions with their neighbors. A dynamic, two player game is formulated whereby …
-
Preference Games and Sink Equilibria
In this thesis we present a new foundation for game theory. Our model for a game is defined precisely by the response graph, a natural object underlying all classical games. We call this model a preference game. Preference games generalise classical games in that all classical games have an …
-
Preference Games and Sink Equilibria
In this thesis we present a new foundation for game theory. Our model for a game is defined precisely by the response graph, a natural object underlying all classical games. We call this model a preference game. Preference games generalise classical games in that all classical games have an …
-
The complexity of continuous local search
… and show that ENDOFPOTENTIALLINE is in CLS via a two-way reduction to ENDOFMETEREDLINE. The latter was defined in [18] to keep track of how far a vertex is on the PPAD path via a restricted potential function, and was shown to be in CLS. Third, we reduce P-LCP to ENDOFPOTENTIALLINE, thus making …
-
Extending the analysis of the FlipIt game
In this thesis, we extend the game theoretical analysis of the FlipIt game¹. The game was first articulated and analyzed by Marten van Dijk, Ari Juels, Alina Oprea and Ronald L. Rivest. FlipIt (or otherwise The Game of "Stealthy Takeover") is a game-theoretic framework for modeling computer …
-
Persistent patrolling in the presence of adversarial observers
… generally fail, however, to consider the game theoretic impacts of the adversary seeking to avoid the patroller's detection. The field of patrolling security games that addresses this two-player game is maturing with several authors posing the patrolling scenario as a leader-follower …
-
The complexity of Nash equilibria in multiplayer zero-sum games and coordination games
… minmax theorem to the class of separable multiplayer zero-sum games, introduced in [Bregman and Fokin 1998]. These games are polymatrix-that is, graphical games in which every edge is a two-player game between its endpoints-in which every outcome has zero total sum of players' payoffs. Our …
-
Optimal Vehicle Stability Control with Driver Input and Bounded Uncertainties
… driver-controller interactions as a common two-player game problem where both players attempt to improve their payoffs, i.e., minimize their objective functions, the Game Theory approach is applied to obtain the optimal driver's steering inputs and controller's corrective yaw moment. …
-
The Computational Complexity of Some Games and Puzzles With Theoretical Applications
… thesis is the algorithmic properties of one- and two-player </p> <p>games people enjoy playing, such as Sudoku or Chess. Questions asked about puzzles </p> <p>and games in this context are of the following type: can we design efficient computer </p> <p>programs that play optimally given any …
-
Reactive synthesis of action planners
An increase in the level of autonomy marks one of the fundamental focuses of current robotic systems. This involves the ability of a robot to reason about its environment and plan its motion in order to carry out assigned tasks. For all tasks, it generally involves abstractions into discrete, …
-
Algorithms for fair division through competitive equilibrium
… utility maximizing bundles. My work explores two main directions: algorithms for computing CE of mixed manna (goods and bads), and applications to the fair division of indivisible goods. First, I examine the problem of allocating a mixed manna under additively separable piecewise linear …
-
A Game Theoretic Approach to Resilient Space System Design
… resilient design. To address this gap, a novel game-theoretic methodology is proposed to capture the interactive nature of non-cooperative systems at the strategic design level. The result is a two-player strategic design game in which the system under design and the threat system are both …
-
Games, protocols, and quantum entanglement
… This thesis presents several results involving games and protocols with entangled parties; in each result, we introduce new techniques and methods to analyze soundness against adversaries that can manipulate quantum entanglement. First, we present a protocol wherein a classical verifer interacts …
-
Towards robust and domain invariant feature representations in Deep Learning
… Do representations learned using deep networks just fit a given data distribution or do they sufficiently model the underlying structure of the problem ? This question could be understood using a simple example: If a learning algorithm is shown a number of images of a simple handwritten …