中文
相关论文

相关论文: A game on partial orderings

200 篇论文

Let D = { d_n } be a countable collection of Delta^1_3 degrees. Assuming that all co-analytic games on integers are determined (or equivalently that all reals have ``sharps''), we prove that either D has a Delta^1_3-minimal upper bound, or…

逻辑 · 数学 2016-09-06 Philip Welch

The main purpose of the paper is the proof of a cardinal inequality for a space with points $G_\delta$, obtained with the help of a long version of the Menger game. This result improves a similar one of Scheepers and Tall.

一般拓扑 · 数学 2014-05-12 Leandro F. Aurichi , Angelo Bella

Candogan et al. (2011) provide an orthogonal direct-sum decomposition of finite games into potential, harmonic and nonstrategic components. In this paper we study the issue of decomposing games that are strategically equivalent from a…

计算机科学与博弈论 · 计算机科学 2020-04-01 Joseph Abdou , Nikolaos Pnevmatikos , Marco Scarsini , Xavier Venel

The paper defines a non-cooperative simultaneous finite game to study coalition structure formation with intra and inter-coalition externalities. The novelty of the game is that the game definition embeds a \textit{coalition structure…

最优化与控制 · 数学 2016-12-08 Dmitry V. Levando

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…

逻辑 · 数学 2014-05-09 Stéphane Le Roux

We introduce a first-order theory of finite full binary trees and then identify decidable and undecidable fragments of this theory. We show that the analogue of Hilbert`s 10th Problem is undecidable by constructing a many-to-one reduction…

逻辑 · 数学 2021-11-02 Juvenal Murwanashyaka

A Q-set is an uncountable set of reals all of whose subsets are relative $G_\delta$ sets. We prove that, for an arbitrary uncountable cardinal kappa, there is consistently a Q-set of size $\kappa$ whose square is not Q. This answers a…

逻辑 · 数学 2016-11-28 Joerg Brendle

Impartial selection is the selection of an individual from a group based on nominations by other members of the group, in such a way that individuals cannot influence their own chance of selection. For this problem, we give a deterministic…

计算机科学与博弈论 · 计算机科学 2024-10-07 Javier Cembrano , Felix Fischer , David Hannon , Max Klimm

The game in which acts of participants don't have an adequate description in terms of Boolean logic and classical theory of probabilities is considered. The model of the game interaction is constructed on the basis of a non-distributive…

量子物理 · 物理学 2007-05-23 Andrey Grib , Georges Parfionov

Game semantics describe the interactive behavior of proofs by interpreting formulas as games on which proofs induce strategies. Such a semantics is introduced here for capturing dependencies induced by quantifications in first-order…

计算机科学中的逻辑 · 计算机科学 2009-08-28 Samuel Mimram

For any cardinal $\kappa \geq 2$, there is a unique complete real tree whose points all have valence $\kappa$. In this note, we show that, when $\kappa \geq 3$, it is necessary to assume completeness. More precisely, we show that there…

度量几何 · 数学 2025-11-06 Pénélope Azuelos

Join-preserving maps on the discrete time scale $\omega^+$, referred to as time warps, have been proposed as graded modalities that can be used to quantify the growth of information in the course of program execution. The set of time warps…

计算机科学中的逻辑 · 计算机科学 2024-08-07 Sam van Gool , Adrien Guatto , George Metcalfe , Simon Santschi

We study coalition formation in the framework of hedonic games. There, a set of agents needs to be partitioned into disjoint coalitions, where agents have a preference order over coalitions. A partition is called popular if it does not lose…

计算机科学与博弈论 · 计算机科学 2024-11-11 Martin Bullinger , Matan Gilboa

We introduce Game networks (G nets), a novel representation for multi-agent decision problems. Compared to other game-theoretic representations, such as strategic or extensive forms, G nets are more structured and more compact; more…

计算机科学与博弈论 · 计算机科学 2024-01-18 Pierfrancesco La Mura

We study definable ranks of ordered fields, ordered abelian groups, and linear orders. For an arbitrary linear order $\Gamma$, we construct an ordered abelian group $G$ with archimedian spine $\Gamma$ and an ordered field $K$ with natural…

逻辑 · 数学 2025-12-23 Blaise Boissonneau , Lasse Vogel

In this paper we consider a fragment of the first-order theory of the real numbers that includes systems of equations of continuous functions in bounded domains, and for which all functions are computable in the sense that it is possible to…

计算复杂性 · 计算机科学 2016-08-15 Peter Franek , Stefan Ratschan , Piotr Zgliczynski

The monadic theory of $(\mathbb R,\le)$ with quantification restricted to Borel sets is decidable. The Boolean combinations of $F_\sigma$ sets form an elementary substructure of the Borel sets. Under determinacy hypotheses, the proof…

逻辑 · 数学 2026-03-10 Sven Manthe

We provide, for any regular uncountable cardinal $\kappa$, a new argument for Pincus' result on the consistency of $\mathrm{ZF}$ with the higher dependent choice principle $\mathrm{DC}_{<\kappa}$ and the ordering principle in the presence…

逻辑 · 数学 2025-10-20 Peter Holy , Jonathan Schilhan

In this paper we will be examining impartial scoring play games. We first give the basic definitions for what impartial scoring play games are and look at their general structure under the disjunctive sum. We will then examine the game of…

组合数学 · 数学 2012-08-07 Fraser Stewart

We consider discrete time partially observable zero-sum stochastic game with average payoff criterion. We study the game using an equivalent completely observable game. We show that the game has a value and also we come up with a pair of…

最优化与控制 · 数学 2014-09-16 Subhamay Saha