Results 41 to 50 of about 86 (78)

Do not blame Bellman: it is Koopmans' fault [PDF]

We provide a unified approach to stochastic dynamic programming with recursive utility based on an elementary application of Tarski's fixed point theorem.
Le Van, Cuong, Vailakis, Yiannis, Bloise, Gaetano   +2 more
core   +1 more source

Weak compactness cardinals for strong logics and subtlety properties of the class of ordinals

Journal of the London Mathematical Society, Volume 112, Issue 1, July 2025.
Abstract Motivated by recent work of Boney, Dimopoulos, Gitman, and Magidor, we characterize the existence of weak compactness cardinals for all abstract logics through combinatorial properties of the class of ordinals. This analysis is then used to show that, in contrast to the existence of strong compactness cardinals, the existence of weak ...
Philipp Lücke
wiley   +1 more source

A discrete Nash Theorem with low complexity and dynamic equilibria [PDF]

, 2006
Nash's Theorem guarantees the existence of Nash equilibria for strategic-form games. The typical proof of the result uses Brouwer's Fixed Point Theorem on probabilistic strategies.
Roux, Stephane Le, Lescanne, Pierre, Vestergaard, Rene   +2 more
core  

On the one‐dimensional polynomial, regular, and regulous images of closed balls and spheres

Journal of the London Mathematical Society, Volume 112, Issue 1, July 2025.
Abstract We present a full geometric characterization of the one‐dimensional (semialgebraic) images S$S$ of either n$n$‐dimensional closed balls B¯n⊂Rn$\overline{{\mathcal {B}}}_n\subset {\mathbb {R}}^n$ or n$n$‐dimensional spheres Sn⊂Rn+1${\mathbb {S}}^n\subset {\mathbb {R}}^{n+1}$ under polynomial, regular, and regulous maps for some n⩾1$n\geqslant 1$
José F. Fernando
wiley   +1 more source

A Short And Constructive Proof of Tarski's Fixed-Point Theorem [PDF]

I give short and constructive proofs of Tarski's fixed-point theorem, and of a much-used extension of Tarski's fixed-point theorem to set- valued maps.tarski, fixed-point theorem, supermodular, supermodular games, strategic complementarities, equilibrium
Federico Echenique
core  

LOTS as Fixed Point Sets: An Application of Tarski's Fixed Point Theorem (draft)

, 2013
This article has been withdrawn in 2013. The class of LOTS (linearly ordered topological spaces) contains many important spaces, like the set of real numbers, the set of rational numbers and the ordinals. Such spaces have rich topological properties, which are not necessarily hereditary.
openaire   +2 more sources

Strong subgroup recurrence and the Nevo–Stuck–Zimmer theorem

Proceedings of the London Mathematical Society, Volume 130, Issue 6, June 2025.
Abstract Let Γ$\Gamma$ be a countable group and Sub(Γ)$\mathrm{Sub}(\Gamma)$ its Chabauty space, namely, the compact Γ$\Gamma$‐space consisting of all subgroups of Γ$\Gamma$. We call a subgroup Δ∈Sub(Γ)$\Delta \in \mathrm{Sub}(\Gamma)$ a boomerang subgroup if for every γ∈Γ$\gamma \in \Gamma$, γniΔγ−ni→Δ$\gamma ^{n_i} \Delta \gamma ^{-n_i} \rightarrow ...
Yair Glasner, Waltraud Lederle
wiley   +1 more source

Computational reaching of quantified consequences from imperfect initial data

Mathematical Methods in the Applied Sciences, Volume 48, Issue 4, Page 4232-4243, 15 March 2025.
Usually, it is not direct to translate theoretical results to practice. One of the challenges is the real computation of solutions to proposed problems, when infinite numbers (such as real numbers or the unit interval) are considered. The same is true when consequences (information) from a data set modeled by logical rules need to be obtained.
Jesús Medina, José Antonio Torné‐Zambrano   +1 more
wiley   +1 more source

Dialetheism and the countermodel problem

Philosophy and Phenomenological Research, Volume 110, Issue 2, Page 709-733, March 2025.
Abstract According to some dialetheists, we ought to reject the distinction between object and meta‐languages. Given that dialetheists advocate truth‐value gluts within their object‐language, whether in order to solve the liar paradox or for some other reason, this rejection of the object‐/meta‐language distinction comes with the commitment to use a ...
Andreas Fjellstad, Ben Martin
wiley   +1 more source

Core Many-to-one Matchings by Fixed-point Methods [PDF]

We characterize the core many-to-one matchings as fixed points of a map. Our characterization gives an algorithm for finding core allocations; the algorithm is efficient and simple to implement.
Federico Echenique, Jorge Oviedo
core