中文
相关论文

相关论文: Balanced 2-subsets

200 篇论文

We construct several definitions of imbalance and playability, both of which are related to the existence of dominated strategies. Specifically, a maximally balanced game and a playable game cannot have dominated strategies for any player.…

综合经济学 · 经济学 2025-11-07 Itai Maimon

In this paper, firstly, we mainly study the relationship of balanced pairs among three Abelian categories in a recollement. As an application of admissible balanced pairs, we introduce the notion of the relative tilting modules, and give a…

范畴论 · 数学 2022-05-20 Peiyu Zhang , Dajun Liu , Jiaqun Wei

Tree Ensemble (TE) models, such as Gradient Boosted Trees, often achieve optimal performance on tabular datasets, yet their lack of transparency poses challenges for comprehending their decision logic. This paper introduces TE2Rules (Tree…

机器学习 · 计算机科学 2024-01-25 G Roshan Lal , Xiaotong Chen , Varun Mithal

Let $(P,\leq)$ be a finite poset (partially ordered set), where $P$ has cardinality $n$. Consider linear extensions of $P$ as permutations $x_1x_2\cdots x_n$ in one-line notation. For distinct elements $x,y\in P$, we define…

组合数学 · 数学 2018-02-02 Emily J. Olson , Bruce E. Sagan

In this work we show that the systems of balance equations (balance systems) of continuum thermodynamics occupy a natural place in the variational bicomplex formalism. We apply the vertical homotopy decomposition to get a local splitting…

数学物理 · 物理学 2011-07-12 Serge Preston

We prove that every two-player non-zero-sum Borel game with lower-semi-continuous payoffs admits a subgame-perfect $\ep$-equilibrium. This result complements Example 3 in Solan and Vieille (2003), which shows that a subgame-perfect…

概率论 · 数学 2009-11-18 Ayala Mashiah-Yaakovi , Eilon Solan

In cooperative game theory, the social configurations of players are modeled by balanced collections. The Bondareva-Shapley theorem, perhaps the most fundamental theorem in cooperative game theory, characterizes the existence of solutions…

计算机科学与博弈论 · 计算机科学 2024-06-25 Dylan Laplace Mermoud , Pierre Popoli

Combinatorial methods (or methods of elementary transformations) came to group theory from low-dimensional topology in the beginning of the century. Soon after that, combinatorial group theory became an independent area with its own…

群论 · 数学 2009-09-25 Vladimir Shpilrain

H. Furstenberg introduced the notion of central sets in terms of topological dynamics and established the famous Central Sets Theorem. Later in [A new and stronger Central Sets Theorem, Fund. Math. 199 (2008), 155-175], D. De, N. Hindman,…

组合数学 · 数学 2026-02-04 Pintu Debnath

In this paper we prove two new abstract compactness criteria in normed spaces. To this end we first introduce the notion of an equinormed set using a suitable family of semi-norms on the given normed space satisfying some natural…

泛函分析 · 数学 2023-06-23 Jacek Gulgowski , Piotr Kasprzak , Piotr Maćkowiak

This document comprises Level Theory, parts 1-3. PART 1. The following bare-bones story introduces the idea of a cumulative hierarchy of pure sets: 'Sets are arranged in stages. Every set is found at some stage. At any stage S: for any sets…

逻辑 · 数学 2021-12-02 Tim Button

In recent years, attempts to generalize lattice gauge theories to model topological order have been carried out through the so called $2$-gauge theories. These have opened the door to interesting new models and new topological phases which…

A classic theorem in combinatorial design theory is Fisher's inequality, which states that a family $\mathcal F$ of subsets of $[n]$ with all pairwise intersections of size $\lambda$ can have at most $n$ non-empty sets. One may weaken the…

组合数学 · 数学 2015-11-04 Shagnik Das , Benny Sudakov , Pedro Vieira

The concept of balance between two state preserving quantum Markov semigroups on von Neumann algebras is introduced and studied as an extension of conditions appearing in the theory of quantum detailed balance. This is partly motivated by…

数学物理 · 物理学 2018-06-29 Rocco Duvenhage , Machiel Snyman

We study balanced solutions for network bargaining games with general capacities, where agents can participate in a fixed but arbitrary number of contracts. We provide the first polynomial time algorithm for computing balanced solutions for…

计算机科学与博弈论 · 计算机科学 2013-06-19 Linda Farczadi , Konstantinos Georgiou , Jochen Koenemann

We further study sets of labeled dice in which the relation "is a better die than" is non-transitive. Focusing on sets with an additional symmetry we call "balance," we prove that sets of $n$ such $m$-sided dice exist for all $n,m \geq 3$.…

组合数学 · 数学 2017-06-29 Alex Schaefer

We introduce several methods of decomposition for two player normal form games. Viewing the set of all games as a vector space, we exhibit explicit orthonormal bases for the subspaces of potential games, zero-sum games, and their orthogonal…

计算机科学与博弈论 · 计算机科学 2011-07-19 Sung-Ha Hwang , Luc Rey-Bellet

In the game theory literature, there appears to be little research on equilibrium selection for normal-form games with an infinite strategy space and discontinuous utility functions. Moreover, many existing selection methods are not…

计算机科学与博弈论 · 计算机科学 2018-09-24 Yuke Li , A. Stephen Morse

In 2009, Kong, Wang, and Lee introduced the problem of finding the edge-balanced index sets ($EBI$) of complete bipartite graphs $K_{m,n}$, where they examined the cases $n=1$, $2$, $3$, $4$, $5$ and the case $m=n$. Since then the problem…

组合数学 · 数学 2015-09-08 Ha Dao , Hung Hua , Michael Ngo , Christopher Raridan

This paper introduces the concept of perfect monotone equilibrium in Bayesian games, which refines the standard monotone equilibrium by accounting for the possibility of unintended moves (trembling hand) and thereby enhancing robustness to…

理论经济学 · 经济学 2025-10-16 Wei He , Yeneng Sun , Hanping Xu