Related papers: Closed Discrete Selection in the Compact Open Topo…
In recent years, with the advancement of frontier AI, we have observed certain dynamics in open-sourcing and closed-sourcing decisions. We propose a game-theoretic model to analyze these dynamics in the current landscape of the AI race. Our…
For a topological space X, let (RX)s := (RX,Ts) be the cartesian product of |X| copies of the real line R with the topology of the uniform convergence on separable subsets of X. In this article we analyze the subspace C(X) of (RX)s of all…
Zero-sum Dynkin games under Poisson constraints, where players can only stop at the event times of a Poisson process, have been studied widely in the recent literature. The constraint can be modelled in two ways: either both players share…
A `discrete differential manifold' we call a countable set together with an algebraic differential calculus on it. This structure has already been explored in previous work and provides us with a convenient framework for the formulation of…
1) We introduce random discrete Morse theory as a computational scheme to measure the complicatedness of a triangulation. The idea is to try to quantify the frequence of discrete Morse matchings with a certain number of critical cells. Our…
We prove that for a stratifiable scattered space $X$ of finite scattered height, the function space $C_k(X)$ endowed with the compact-open topology is Baire if and only if $X$ has the Moving Off Property of Gruenhage and Ma. As a byproduct…
This paper studies and bounds the effects of approximating loss functions and credal sets on choice functions, under very weak assumptions. In particular, the credal set is assumed to be neither convex nor closed. The main result is that…
This work establishes sufficient conditions for existence of saddle points in discrete Markov games. The result reveals the relation between dynamic games and static games using dynamic programming equations. This result enables us to prove…
Molodstov[10] introduced soft set theory as a new mathematical approach for solving problems having uncertainties. Many researchers worked on the findings of structures of soft set theory and applied to many problems having uncertainties.…
The Small-Set Expansion Hypothesis (Raghavendra, Steurer, STOC 2010) is a natural hardness assumption concerning the problem of approximating the edge expansion of small sets in graphs. This hardness assumption is closely connected to the…
We give a characterization of countable discrete subspace $A$ of a topological space $X$ such that there exists a (linear) continuous mapping $\varphi:C_p^*(A)\to C_p(X)$ with $\varphi(y)|_A=y$ for every $y\in C_p^*(A)$. Using this…
This paper develops a unified framework for zero-sum games in which both the pure strategies and the payoff matrices contain complex-valued entries. By leveraging a linear isomorphism between complex and real vector spaces, we extend key…
We prove existence of a self-financing strategy which minimizes shortfall for game options in discrete time
We study a robust Dynkin game over a set of mutually singular probabilities. We first prove that for the conservative player of the game, her lower and upper value processes coincide (i.e. She has a value process $V $ in the game). Such a…
Moves in chess games are usually analyzed on a case-by-case basis by professional players, but thanks to the availability of large game databases, we can envision another approach of the game. Here, we indeed adopt a very different point of…
We consider a convexity constrained Hamilton-Jacobi-Bellman-type obstacle problem for the value function of a zero-sum differential game with asymmetric information. We propose a convexity-preserving probabilistic numerical scheme for the…
As proved in [16], for a Tychonoff space $X$, a locally convex space $C_{p}(X)$ is distinguished if and only if $X$ is a $\Delta$-space. If there exists a linear continuous surjective mapping $T:C_p(X) \to C_p(Y)$ and $C_p(X)$ is…
This paper considers the theoretical, computational, and econometric properties of continuous time dynamic discrete choice games with stochastically sequential moves, introduced by Arcidiacono, Bayer, Blevins, and Ellickson (2016). We…
We show that a fairly arbitrary Frechet space topology on the space of holomorphic functions on a domain controls the topology of uniform convergence on compact sets. In fact it turns out that the result we present can be proved more simply…
Recent research has led to the development of MCMC algorithms with likelihood-informed proposals when targeting posterior distributions supported on discrete state spaces. Our work is placed within this field and puts forward a new MCMC…