Related papers: Selection Games on Continuous Functions

First steps towards a mathematical theory of deep convolutional neural networks for feature extraction were made---for the continuous-time case---in Mallat, 2012, and Wiatowski and B\"olcskei, 2015. This paper considers the discrete case,…

The two main results of this work are the following: if a space $X$ is such that player II has a winning strategy in the game $\gone(\Omega_x, \Omega_x)$ for every $x \in X$, then $X$ is productively countably tight. On the other hand, if a…

In this paper, we study games with continuous action spaces and non-linear payoff functions. Our key insight is that Lipschitz continuity of the payoff function allows us to provide algorithms for finding approximate equilibria in these…

Generalized topological spaces in the sense of Cs\'{a}sz\'{a}r have two main features which distinguish them from typical topologies. First, these families of subsets are not closed under intersections. Second, we allow for the possibility…

An active line of research has considered games played on networks in which payoffs depend on both a player's individual decision and also the decisions of her neighbors. Such games have been used to model issues including the formation of…

We study the population genetics of Evolution in the important special case of weak selection, in which all fitness values are assumed to be close to one another. We show that in this regime natural selection is tantamount to the…

In this dissertation, we analyze the computational properties of game-theoretic centrality measures. The key idea behind game-theoretic approach to network analysis is to treat nodes as players in a cooperative game, where the value of each…

Thamrongthanyalak demonstrated a definable version of Michael's selection theorem in d-minimal expansions of the real field. We generalize this result to the case in which the structures are d-minimal expansions of ordered fields $\mathcal…

In this paper we extend the framework of evolutionary inspection game put forward recently by the author and coworkers to a large class of conflict interactions dealing with the pressure executed by the major player (or principal) on the…

Categories of polymorphic lenses in computer science, and of open games in compositional game theory, have a curious structure that is reminiscent of compact closed categories, but differs in some crucial ways. Specifically they have a…

We reduce the problem of proving a "Boolean Unique Games Conjecture" (with gap 1-delta vs. 1-C*delta, for any C> 1, and sufficiently small delta>0) to the problem of proving a PCP Theorem for a certain non-unique game. In a previous work,…

In the game theory literature, there appears to be little research on equilibrium selection for normal-form games with an infinite strategy space and discontinuous utility functions. Moreover, many existing selection methods are not…

Evolutionary games on graphs play an important role in the study of evolution of cooperation in applied biology. Using rigorous mathematical concepts from a dynamical systems and graph theoretical point of view, we formalize the notions of…

In [12] we formulated an evolutionary game theory model as a dynamical system on the state space of finite signed Borel measures under the weak* topology. The focus of this paper is to extend the analysis to include the long-time behavior…

We provide a complete characterization of the solvability/impossibility of deterministic stabilizing consensus in any computing model with benign process and communication faults using point-set topology. Relying on the topologies for…

The notion of "pseudocompactness" was introduced by Hewitt. The concept of relatively countably compact subspaces were explored by Marjanovic to show that a $\Psi$-space is pseudocompact. A topological space is said to be DRC (DRS) iff it…

In Persistent Homology and Topology, filtrations are usually given by introducing an ordered collection of sets or a continuous function from a topological space to $\R^n$. A natural question arises, whether these approaches are equivalent…

In addressing the challenge of exponential scaling with the number of agents we adopt a cluster-based representation to approximately solve asymmetric games of very many players. A cluster groups together agents with a similar "strategic…

We prove the closedness theorem over Henselian valued fields, which was established over rank one valued fields in one of our recent papers. In the proof, as before, we use the local behaviour of definable functions of one variable and the…

We study continuity properties of stochastic game problems with respect to various topologies on information structures, defined as probability measures characterizing a game. We will establish continuity properties of the value function…