相关论文: Determinacy and \Delta^1_3-degrees

In combinatorial game theory, the lower and upper bounds of the number of games born by day $4$ have been recognized as $3.0 \cdot 10^{12}$ and $10^{434}$, respectively. In this study, we improve the lower bound to $10^{28.2}$ and the upper…

We study unique games and estimate some of their values. We prove that if a unique game has a quantum-assisted value close to 1, then it must have a perfect deterministic strategy. We introduce a family of unique games based on groups that…

We study deterministic optimal control problems for differential games with finite horizon. We propose new approximations of the strategies in feedback form, and show error estimates and a convergence result of the value in some weak sense…

We consider a team formation setting where agents have varying levels of expertise in a global set of required skills, and teams are ranked with respect to how well the expertise of teammates complement each other. We model this setting as…

The maximum number of vertices in a graph of maximum degree $\Delta\ge 3$ and fixed diameter $k\ge 2$ is upper bounded by $(1+o(1))(\Delta-1)^{k}$. If we restrict our graphs to certain classes, better upper bounds are known. For instance,…

Given a graph $G$ of $n$ vertices, where each vertex is initially attached an opinion of either red or blue. We investigate a random process known as the Best-of-three voting. In this process, at each time step, every vertex chooses three…

A well-known theorem of Vizing states that if $G$ is a simple graph with maximum degree $\Delta$, then the chromatic index $\chi'(G)$ of $G$ is $\Delta$ or $\Delta+1$. A graph $G$ is class 1 if $\chi'(G)=\Delta$, and class 2 if…

The dollar game is a chip-firing game introduced by Baker and Norine (2007) as a context in which to formulate and prove the Riemann-Roch theorem for graphs. A divisor on a graph is a formal integer sum of vertices. Each determines a dollar…

The domination game is an optimization game played by two players, Dominator and Staller, who alternately select vertices in a graph $G$. A vertex is said to be dominated if it has been selected or is adjacent to a selected vertex. Each…

Concurrent multi-player mean-payoff games are important models for systems of agents with individual, non-dichotomous preferences. Whilst these games have been extensively studied in terms of their equilibria in non-cooperative settings,…

Over the past 30 years numerous algorithms have been designed for symmetry breaking problems in the LOCAL model, such as maximal matching, MIS, vertex coloring, and edge-coloring. For most problems the best randomized algorithm is at least…

The Constant Degree Hypothesis was introduced by Barrington et. al. (1990) to study some extensions of $q$-groups by nilpotent groups and the power of these groups in a certain computational model. In its simplest formulation, it…

The least upper bound on degrees of elements of a minimal system of generators of the algebra of invariants of 3x3 matrices is found, and the nilpotency degree of a relatively free finitely generated algebra with the identity x^3=0 is…

In this paper we provide three new results axiomatizing the core of games in characteristic function form (not necessarily having transferable utility) obeying an innocuous condition (that the set of individually rational pay-off vectors is…

Estimating discrete games of complete information is often computationally difficult due to partial identification and the absence of closed-form moment characterizations. This paper proposes computationally tractable approaches to…

Let $\mathbb K$ be a field of characteristic 0. Let $\Gamma\subset\mathbb P^n_{\mathbb K}$ be a reduced finite set of points, not all contained in a hyperplane. Let $hyp(\Gamma)$ be the maximum number of points of $\Gamma$ contained in any…

We define the family of {\it locally path-bounded} digraphs, which is a class of infinite digraphs, and show that on this class it is relatively easy to compute an optimal strategy (winning or nonlosing); and realize a win, when possible,…

Total coloring is a variant of edge coloring where both vertices and edges are to be colored. A graph is totally $k$-choosable if for any list assignment of $k$ colors to each vertex and each edge, we can extract a proper total coloring. In…

A finite non-increasing sequence of positive integers $d = (d_1\geq \cdots\geq d_n)$ is called a degree sequence if there is a graph $G = (V,E)$ with $V = \{v_1,\ldots,v_n\}$ and $deg(v_i)=d_i$ for $i=1,\ldots,n$. In that case we say that…

Playing repeated matrix games (RMG) while maximizing the cumulative returns is a basic method to evaluate multi-agent learning (MAL) algorithms. Previous work has shown that $UCB$, $M3$, $S$ or $Exp3$ algorithms have good behaviours on…