Results 1 to 10 of about 86 (78)

A note on a Tarski type fixed-point theorem [PDF]

International Journal of Game Theory, 2021
AbstractIn this paper we propose a basic fixed-point theorem for correspondences inspired by Tarski’s intersection point theorem. This result furnishes an efficient tool to prove the existence of pure strategy Nash equilibria for two player games with possibly discontinuous payoffs functions defined on compact real intervals.
openaire   +3 more sources

TARSKI’S FIXED POINT THEOREM IN DEDEKIND CATEGORIES [PDF]

Bulletin of informatics and cybernetics, 2006
Tarski’s fixed point theorem for complete lattices is a fundamental theorem in lattice theory and is very useful for computer science applications. This paper will show a general result in Dedekind categories, which extends the Tarski’s theorem.
Kawahara, Yasuo, Honda, Kazumasa
openaire   +1 more source

A soft version of the Knaster–Tarski fixed point theorem with applications [PDF]

Journal of Fixed Point Theory and Applications, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Leyew, Bahru Tsegaye, Abbas, Mujahid
openaire   +2 more sources

The Study of Lattice Structure of Bipartite Stable Matchings With Flexible Agents

IEEE Access, 2019
In this paper, we obtain a set of pairwise stable outcomes in two-sided hybrid matching market with price externalities. In this market, the valuation of agents depends upon money.
B. Shaukat, Q. Kiran, W. Shatanawi, Y. Ali   +3 more
doaj   +1 more source

On Tarski’s fixed point theorem [PDF]

Proceedings of the American Mathematical Society, 2015
Proc. Amer. Math.
openaire   +4 more sources

On Stable Matchings and Flows

Algorithms, 2014
We describe a flow model related to ordinary network flows the same way as stable matchings are related to maximum matchings in bipartite graphs. We prove that there always exists a stable flow and generalize the lattice structure of stable marriages to ...
Tamás Fleiner
doaj   +1 more source

The complexity of Tarski’s fixed point theorem

Theoretical Computer Science, 2008
The Knaster-Tarski theorem says that for every complete lattice \(L\), every order-preserving mapping \(f:L\to L\) has a fixed point. This paper studies the query complexity of this problem. The authors present an algorithm that, for a given complete finite lattice \(L\) and an order-preserving mapping \(f\) of \(L\) given by an oracle, finds a fixed ...
Ching-Lueh Chang, Yuh-Dauh Lyuu, Yen-Wu Ti   +2 more
openaire   +2 more sources

A short and constructive proof of Tarski’s fixed-point theorem [PDF]

International Journal of Game Theory, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

A Proof of Tarski’s Fixed Point Theorem by Application of Galois Connections [PDF]

Studia Logica, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

The I in logic

Theoria, EarlyView.
Abstract This paper argues for the significance of Kaplan's logic LD in two ways: first, by looking at how logic got along before we had LD, and second, by using it to bring out the similarity between David Hume's thesis that one cannot deduce claims about the future on the basis of premises only about the past, and the so‐called "essentiality" of the ...
Gillian Russell
wiley   +1 more source