Related papers: Elliptic curves in game theory
We provide a deterministic-control-based interpretation for a broad class of fully nonlinear parabolic and elliptic PDEs with continuous Neumann boundary conditions in a smooth domain. We construct families of two-person games depending on…
We present a computational formulation for the approximate version of several variational inequality problems, investigating their computational complexity and establishing PPAD-completeness. Examining applications in computational game…
We tackle a fundamental problem in empirical game-theoretic analysis (EGTA), that of learning equilibria of simulation-based games. Such games cannot be described in analytical form; instead, a black-box simulator can be queried to obtain…
Wythoff's game as a classic combinatorial game has been well studied. In this paper, we focus on $(2n+1)$-dimensional Wythoff's game; that is the Wythoff's game with $(2n+1)$ heaps. We characterize their $\mathcal{P}$-positions explicitly…
In cooperative game theory, associated games allow for providing meaningful characterizations of solution concepts. Moreover, generalized values allow computing an influence or power index of each coalition in a game. In this paper, we view…
We examine the routing problem for self-interested vehicles using stochastic decision strategies. By approximating the road latency functions and a non-linear variable transformation, we frame the problem as an aggregative game. We…
We establish a congruence formula between $p$-adic logarithms of Heegner points for two elliptic curves with the same mod $p$ Galois representation. As a first application, we use the congruence formula when $p=2$ to explicitly construct…
We study the approximate core for edge cover games, which are cooperative games stemming from edge cover problems. In these games, each player controls a vertex on a network $G = (V, E; w)$, and the cost of a coalition $S\subseteq V$ is…
We define a family of vertex colouring games played over a pair of graphs or digraphs $(G,H)$ by players $\forall$ and $\exists$. These games arise from work on a longstanding open problem in algebraic logic. It is conjectured that there is…
Let $E$ be a vector bundle over a smooth curve $C$, and $S = \mathbb{P} E$ the associated projective bundle. We describe the inflectional loci of certain projective models $\psi \colon S \dashrightarrow \mathbb{P}^n$ in terms of Quot…
Stochastic games combine controllable and adversarial non-determinism with stochastic behavior and are a common tool in control, verification and synthesis of reactive systems facing uncertainty. Multi-objective stochastic games are natural…
This paper concerns two-player alternating play combinatorial games (Conway 1976) in the normal-play convention, i.e. last move wins. Specifically, we study impartial vector subtraction games on tuples of nonnegative integers (Golomb 1966),…
Graph games provide the foundation for modeling and synthesizing reactive processes. In the synthesis of stochastic reactive processes, the traditional model is perfect-information stochastic games, where some transitions of the game graph…
We propose a nonlinear $\sigma$-model in a curved space as a general integrable elliptic model. We construct its exact solutions and obtain energy estimates near the critical point. We consider the Pohlmeyer transformation in Euclidean…
With increasing game size, a problem of computational complexity arises. This is especially true in real world problems such as in social systems, where there is a significant population of players involved in the game, and the complexity…
The additively separable hedonic game (ASHG) is a model of coalition formation games on graphs. In this paper, we intensively and extensively investigate the computational complexity of finding several desirable solutions, such as a Nash…
Multiplayer games on graphs are at the heart of theoretical descriptions of key evolutionary processes that govern vital social and natural systems. However, a comprehensive theoretical framework for solving multiplayer games with an…
We investigate modularity of elliptic curves over a general totally real number field, establishing a finiteness result for the set non-modular $j$-invariants. By analyzing quadratic points on some modular curves, we show that all elliptic…
We consider the basic problem of approximating Nash equilibria in noncooperative games. For monotone games, we design continuous time flows which converge in an averaged sense to Nash equilibria. We also study mean field equilibria, which…
Game theory provides a mathematical framework for analysing strategic situations involving at least two players. Normal-form games model situations where the players simultaneously pick their moves. In this thesis we explore the strategic…