English
Related papers

Related papers: Telgarsky's conjecture may fail

200 papers

Game theory is usually considered applied mathematics, but a few game-theoretic results, such as Borel determinacy, were developed by mathematicians for mathematics in a broad sense. These results usually state determinacy, i.e. the…

Logic · Mathematics 2014-05-09 Stéphane Le Roux

In 2000 Allen Schwenk, using a well-known mathematical model of matchplay tournaments in which the probability of one player beating another in a single match is fixed for each pair of players, showed that the classical single-elimination,…

Probability · Mathematics 2018-03-05 Peter Hegarty , Anders Martinsson , Edvin Wedin

We obtain a refinement of a selection principle for $(\mathcal{K}, \lambda)$-wide-$(s)$ sequences in Banach spaces due to Rosenthal. This result is then used to show that if $C$ is a bounded, non-weakly compact, closed convex subset of a…

Functional Analysis · Mathematics 2019-03-01 Cleon S. Barroso , Torrey M. Gallagher

Although mixed extensions of finite games always admit equilibria, this is not the case for countable games, the best-known example being Wald's pick-the-larger-integer game. Several authors have provided conditions for the existence of…

Computer Science and Game Theory · Computer Science 2017-04-04 Valerio Capraro , Marco Scarsini

Muchnik's paradox says that enumerable betting strategies are not always reducible to enumerable strategies whose bets are restricted to either even rounds or odd rounds. In other words, there are outcome sequences x where an effectively…

Logic · Mathematics 2022-01-19 George Barmpalias , Lu Liu

We study the Maker-Breaker tournament game played on the edge set of a given graph $G$. Two players, Maker and Breaker claim unclaimed edges of $G$ in turns, and Maker wins if by the end of the game she claims all the edges of a pre-defined…

Combinatorics · Mathematics 2015-09-23 Dennis Clemens , Mirjana Mikalački

We use techniques of proof mining to extract a uniform rate of metastability (in the sense of Tao) for the strong convergence of approximants to fixed points of uniformly continuous pseudocontractive mappings in Banach spaces which are…

Functional Analysis · Mathematics 2020-01-17 Ulrich Kohlenbach , Andrei Sipos

For two graphs $B$ and $H$ the strong Ramsey game $\mathcal{R}(B,H)$ on the board $B$ and with target $H$ is played as follows. Two players alternately claim edges of $B$. The first player to build a copy of $H$ wins. If none of the players…

Combinatorics · Mathematics 2020-03-11 Stefan David , Ivailo Hartarsky , Marius Tiba

A Banach space $X$ has the ball fixed point property (BFPP) if for every closed ball $B$ and for every nonexpansive mapping $T\colon B\to B$, there is a fixed point. We study the BFPP for $C(K)$-spaces. Our goal is to determine topological…

Functional Analysis · Mathematics 2025-06-24 Antonio Avilés , María Japón , Christopher Lennard , Gonzalo Martínez Cervantes , Adam Stawski

In [8] probabilistic methods, in particular a variant of the Weak Law of Large Numbers related to the Bernoulli distribution, have been used to show that for every infinite compact spaces K and L there exists a sequence $(\mu_n)$ of…

Functional Analysis · Mathematics 2025-12-02 Jerzy Kakol , Wiesław Śliwa

In a $(1:b)$ biased Maker-Breaker game, how good a strategy is for a player can be measured by the bias range for which its rival can win, choosing an appropriate counterstrategy. Bednarska and {\L}uczak proved that, in the $H$-subgraph…

Combinatorics · Mathematics 2019-07-11 Ander Lamaison

In a pursuit-evasion game, a team of pursuers attempt to capture an evader. The players alternate turns, move with equal speed, and have full information about the state of the game. We consider the most restictive capture condition: a…

Metric Geometry · Mathematics 2015-05-05 Andrew Beveridge , Yiqing Cai

The AB~Game is a game similar to the popular game Mastermind. We study a version of this game called Static Black-Peg AB~Game. It is played by two players, the codemaker and the codebreaker. The codemaker creates a so-called secret by…

Combinatorics · Mathematics 2022-10-11 Gerold Jäger , Frank Drewes

A generalization of Lozanovskii's result is proved. Let E be $k$-dimensional subspace of an $n$-dimensional Banach space with unconditional basis. Then there exist $x_1,..,x_k \subset E$ such that $B_E \p \subset \p absconv\{x_1,..,x_k\}$…

Functional Analysis · Mathematics 2016-09-06 Marius Junge

In this paper, I prove the existence of a pure-strategy Nash equilibrium for a large class of games with nonconvex strategy spaces. Specifically, if each player's strategies form a compact, connected Euclidean neighborhood retract and if…

Theoretical Economics · Economics 2023-08-23 Conrad Kosowsky

In 1998 Kleinbock conjectured that any set of weighted badly approximable $d\times n$ real matrices is a winning subset in the sense of Schmidt's game. In this paper we prove this conjecture in full for vectors in $\mathbf{R}^d$ in…

Number Theory · Mathematics 2020-12-10 Victor Beresnevich , Erez Nesharim , Lei Yang

We investigate strong Nash equilibria in the \emph{max $k$-cut game}, where we are given an undirected edge-weighted graph together with a set $\{1,\ldots, k\}$ of $k$ colors. Nodes represent players and edges capture their mutual…

Computer Science and Game Theory · Computer Science 2018-10-23 Raffaello Carosi , Simone Fioravanti , Luciano Gualà , Gianpiero Monaco

We give a new proof of the following theorem due to W. Weiss and P. Komjath: if $X$ is a regular topological space, with character $ < \mathfrak{b}$ and $X \rightarrow (top \omega + 1)^{1}_{\omega}$, then, for all $\alpha < \omega_1$, $X…

General Topology · Mathematics 2022-04-08 Rodrigo Carvalho , Gabriel Fernandes , Lúcia R. Junqueira

We analyse the computational complexity of finding Nash equilibria in turn-based stochastic multiplayer games with omega-regular objectives. We show that restricting the search space to equilibria whose payoffs fall into a certain interval…

Computer Science and Game Theory · Computer Science 2015-07-01 Michael Ummels , Dominik Wojtczak

The Akbari-Cameron-Khosrovshahi (ACK) conjecture, which appears to be unresolved, states that for any simple graph $G$ with at least one edge, there exists a nonzero {$\{0,1\}$}-vector in the row space of its adjacency matrix that is not a…

Combinatorics · Mathematics 2026-01-07 S. Akansha , K. C. Sivakumar
‹ Prev 1 3 4 5 6 7 10 Next ›