English
Related papers

Related papers: Ideal games and Ramsey sets

200 papers

This paper introduces a geometric framework for analyzing power relations in games, independent of their strategic form. We define a canonical preference space where each player's relational stance is a normalized vector. This model…

Theoretical Economics · Economics 2025-11-11 Daniele De luca

In this article, we investigate homogeneous versions of certain nonlinear Ramsey-theoretic results, with three significant applications. As the first application, we prove that for every finite coloring of $\mathbb{Z}^+$, there exist an…

Combinatorics · Mathematics 2025-04-16 Sukumar Das Adhikari , Sayan Goswami

Let $\ast $ be a star operation of finite character. Call a $\ast $-ideal $I$ of finite type a $\ast $-homogeneous ideal if $I$ is contained in a unique maximal $\ast $-ideal $M=M(I).$ A maximal $\ast $-ideal that contains a $\ast…

Commutative Algebra · Mathematics 2022-01-03 Muhammad Zafrullah

In this article, we study the notion of semi-stability and the Harder-Narasimhan filtration from a game-theoretic point of view. This allows us to provide a unified proof for the existence and uniqueness of the Harder-Narasimhan filtration…

Algebraic Geometry · Mathematics 2023-06-16 Huayi Chen , Marion Jeannin

Choice functions constitute a simple, direct and very general mathematical framework for modelling choice under uncertainty. In particular, they are able to represent the set-valued choices that typically arise from applying decision rules…

Artificial Intelligence · Computer Science 2018-06-05 Jasper De Bock , Gert de Cooman

We consider an assignment problem that has aspects of fair division as well as social choice. In particular, we investigate the problem of assigning a small subset from a set of indivisible items to multiple players so that the chosen…

Computer Science and Game Theory · Computer Science 2019-02-06 Warut Suksompong

In this note we provide a counter-example to a conjecture of K. Pardue [Thesis, Brandeis University, 1994.], which asserts that if a monomial ideal is $p$-Borel-fixed, then its $\naturals$-graded Betti table, after passing to any field does…

Commutative Algebra · Mathematics 2013-08-21 Giulio Caviglia , Manoj Kummini

We analyze asymptotic convergence properties of Newton's method for a class of evolutive Mean Field Games systems with non-separable Hamiltonian arising in mean field type models with congestion. We prove the well posedness of the Mean…

Optimization and Control · Mathematics 2024-03-20 Fabio Camilli , Qing Tang

A nearly logarithmic lower bound on the randomized competitive ratio for the metrical task systems problem is presented. This implies a similar lower bound for the extensively studied k-server problem. The proof is based on Ramsey-type…

Data Structures and Algorithms · Computer Science 2007-05-23 Yair Bartal , Bela Bollobas , Manor Mendel

Let $(X, H)$ be a normal complex projective polarized variety and $\mathscr E$ an $H$-semistable sheaf on $X$. We prove that the restriction $\mathscr E\big|_C$ to a sufficiently positive general complete intersection curve $C \subset X$…

Algebraic Geometry · Mathematics 2020-11-05 Patrick Graf

We consider a Ramsey model with several households with heterogeneous preferences who are able to borrow capital to each other. Since the capital constraints of one household then depends on the others' capital, one can no longer optimize…

Optimization and Control · Mathematics 2019-09-04 L. Frerick , G. Müller-Fürstenberger , E. W. Sachs , L. Somorowsky

Let $R$ be a commutative ring, $Y\subseteq \mathrm{Spec}(R)$ and $ h_Y(S)=\{P\in Y:S\subseteq P \}$, for every $S\subseteq R$. An ideal $I$ is said to be an $\mathcal{H}_Y$-ideal whenever it follows from $h_Y(a)\subseteq h_Y(b)$ and $a\in…

Commutative Algebra · Mathematics 2018-07-31 A. R. Aliabad , M. Badie , S. Nazari

We prove that under a principle of Ramsey regularity there are no infinite maximal almost disjoint families with respect to the transfinitely iterated Fr\'echet ideals. The results of the present paper were announced by the authors in the…

Logic · Mathematics 2024-12-04 David Schrittesser , Asger Törnquist

The strategic selection of resources by selfish agents is a classic research direction, with Resource Selection Games and Congestion Games as prominent examples. In these games, agents select available resources and their utility then…

Computer Science and Game Theory · Computer Science 2024-06-14 Jonathan Gadea Harder , Simon Krogmann , Pascal Lenzner , Alexander Skopalik

Ehrenfeucht-Fra\"iss\'e games provide a fundamental method for proving elementary equivalence (and equivalence up to a certain quantifier rank) of relational structures. We investigate the soundness and completeness of this method in the…

Logic in Computer Science · Computer Science 2023-08-10 Sophie Brinke , Erich Grädel , Lovro Mrkonjić

We consider finitary approximations of the (embedding) Ramsey property. Using a class of homogeneous reducts of random ordered hypergraphs, we prove that these properties form a strict hierarchy. We also show that every class of finite…

Combinatorics · Mathematics 2023-07-28 Nadav Meir , Aris Papadopoulos

LP-duality theory has played a central role in the study of cores of games, right from the early days of this notion to the present time. The classic paper of Shapley and Shubik \cite{Shapley1971assignment} introduced the "right" way of…

Computer Science and Game Theory · Computer Science 2022-11-29 Vijay V. Vazirani

Let $R$ be a commutative, Noetherian, local ring and $M$ an $R$-module. Consider the module of homomorphisms $\operatorname{Hom}_R(R/\mathfrak{a},M/\mathfrak{b} M)$ where $\mathfrak{b}\subseteq\mathfrak{a}$ are parameter ideals of $M$. When…

Commutative Algebra · Mathematics 2014-12-19 Katharine Shultis

Informally, a mathematical statement is robust if its strength is left unchanged under variations of the statement. In this paper, we investigate the lack of robustness of Ramsey's theorem and its consequence under the frameworks of reverse…

Logic · Mathematics 2016-02-09 Ludovic Patey

We study nondeterministic strategies in parity games with the aim of computing a most permissive winning strategy. Following earlier work, we measure permissiveness in terms of the average number/weight of transitions blocked by the…

Logic in Computer Science · Computer Science 2013-01-14 Patricia Bouyer , Nicolas Markey , Jörg Olschewski , Michael Ummels
‹ Prev 1 8 9 10 Next ›