中文
相关论文

相关论文: Telgarsky's conjecture may fail

200 篇论文

We establish the first unconditional well-posedness result for the master equation associated with a general class of mean field games of controls. Our analysis covers games with displacement monotone or Lasry--Lions monotone data, as well…

偏微分方程分析 · 数学 2026-02-02 Joe Jackson , Alpár R. Mészáros

We study 2-player turn-based perfect-information stochastic games with countably infinite state space. The players aim at maximizing/minimizing the probability of a given event (i.e., measurable set of infinite plays), such as reachability,…

计算机科学与博弈论 · 计算机科学 2017-04-18 Stefan Kiefer , Richard Mayr , Mahsa Shirmohammadi , Dominik Wojtczak

A topological space is said to be sequential if every sequentially closed subspace is closed. We consider Banach spaces with weak*-sequential dual ball. In particular, we show that if $X$ is a Banach space with weak*-sequentially compact…

泛函分析 · 数学 2016-12-20 Gonzalo Martínez-Cervantes

The Tijdeman-Zagier conjecture states no integer solution exists for $A^X+B^Y=C^Z$ with positive integer bases and integer exponents greater than 2 unless gcd$(A,B,C)>1$. Any set of values that satisfy the conjecture correspond to a lattice…

数论 · 数学 2021-03-16 David Hauser , Ian Hauser

We consider a sub-class of bi-matrix games which we refer to as two-person (hereafter referred to as two-player) additively-separable sum (TPASS) games, where the sum of the pay-offs of the two players is additively separable. The row…

最优化与控制 · 数学 2025-11-03 Somdeb Lahiri

We consider a stochastic tournament game in which each player is rewarded based on her rank in terms of the completion time of her own task and is subject to cost of effort. When players are homogeneous and the rewards are purely rank…

最优化与控制 · 数学 2018-11-02 Erhan Bayraktar , Jakša Cvitanić , Yuchong Zhang

We prove that the determinacy of Gale-Stewart games whose winning sets are accepted by real-time 1-counter B\"uchi automata is equivalent to the determinacy of (effective) analytic Gale-Stewart games which is known to be a large cardinal…

计算机科学中的逻辑 · 计算机科学 2013-12-13 Olivier Finkel

We prove that the determinacy of Gale-Stewart games whose winning sets are accepted by real-time 1-counter B\"uchi automata is equivalent to the determinacy of (effective) analytic Gale-Stewart games which is known to be a large cardinal…

计算机科学与博弈论 · 计算机科学 2012-03-08 Olivier Finkel

We establish the existence of fixed points for set-valued maps defined on metric spaces and satisfying a pointwise or a local version of Banach's contraction property. As an application, we demonstrate the existence of Nash equilibrium in a…

最优化与控制 · 数学 2022-11-24 Ted Loch-Temzelides

On a semi-infinite strip of squares rightward numbered $0, 1, 2, \ldots$ with at most one coin in each square, in Welter's game, two players alternately move a coin to an empty square on its left. Jumping over other coins is legal. The…

组合数学 · 数学 2013-11-13 Nhan Bao Ho

Let $(\{f_j\}_{j=1}^n, \{\tau_j\}_{j=1}^n)$ and $(\{g_k\}_{k=1}^m, \{\omega_k\}_{k=1}^m)$ be p-Schauder frames for a finite dimensional Banach space $\mathcal{X}$. Then for every $x \in \mathcal{X}\setminus\{0\}$, we show that \begin{align}…

泛函分析 · 数学 2026-03-31 K. Mahesh Krishna

We consider the following two-player game on a graph. A token is located at a vertex, and the players take turns to move it along an edge to a vertex that has not been visited before. A player who cannot move loses. We analyze outcomes with…

We confirm a conjecture of Fox, Pach, and Suk, that for every $d>0$, there exists $c>0$ such that every $n$-vertex graph of VC-dimension at most $d$ has a clique or stable set of size at least $n^c$. This implies that, in the language of…

组合数学 · 数学 2025-09-11 Tung Nguyen , Alex Scott , Paul Seymour

In this paper, we obtain a minimax theorem by means of which, in turn, we prove the following result: Let $E$ be an infinite-dimensional reflexive real Banach space, $T:E\to E$ a non-zero compact linear operator, $\varphi:E\to {\bf R}$ a…

泛函分析 · 数学 2015-09-09 Biagio Ricceri

A puzzle about prisoners trying to identify the color of a hat on their head leads to a version where there are k more hats than prisoners. This generalized puzzle is related to the independence number of the arrangement graph A(m, n) and…

组合数学 · 数学 2019-03-25 Rob Pratt , Stan Wagon , Michael Wiener , Piotr Zielinski

Consider a game where Alice generates an integer and Bob wins if he can factor that integer. Traditional game theory tells us that Bob will always win this game even though in practice Alice will win given our usual assumptions about the…

计算机科学与博弈论 · 计算机科学 2009-11-18 Lance Fortnow , Rahul Santhanam

Recently, the first two authors proved the Alon-Jaeger-Tarsi conjecture on non-vanishing linear maps, for large primes. We extend their ideas to address several other related conjectures. We prove the weak Additive Basis conjecture proposed…

组合数学 · 数学 2021-11-29 János Nagy , Péter Pál Pach , István Tomon

A Banach space $X$ is said to have the ball generated property (BGP) if every closed, bounded, convex subset of $X$ can be written as an intersection of finite unions of closed balls. In 2002 S. Basu proved that the BGP is stable under…

泛函分析 · 数学 2015-02-24 Jan-David Hardtke

Edouard Zeckendorf proved that every positive integer $n$ can be uniquely written \cite{Ze} as the sum of non-adjacent Fibonacci numbers, known as the Zeckendorf decomposition. Based on Zeckendorf's decomposition, we have the Zeckendorf…

We make some remarks on the global shape of continuous convex functions defined on a Banach space $Z$. Among other results we prove that if $Z$ is separable then for every continuous convex function $f:Z\to\mathbb{R}$ there exist a unique…

泛函分析 · 数学 2020-01-29 Daniel Azagra
‹ 上一页 1 8 9 10 下一页 ›