English
Related papers

Related papers: Bisynchronous Games and Factorizable Maps

200 papers

Combinatorial games lead to several interesting, clean problems in algorithms and complexity theory, many of which remain open. The purpose of this paper is to provide an overview of the area to encourage further research. In particular, we…

Computational Complexity · Computer Science 2009-09-25 Erik D. Demaine , Robert A. Hearn

Data mining and knowledge discovery are two important growing research fields in the last two decades due to the abundance of data collected from various sources. The exponentially growing volumes of generated data urge the development of…

Computer Science and Game Theory · Computer Science 2020-07-13 Dalila Kessira , Mohand-Tahar Kechadi

We show that the number of $k$-matching in a given undirected graph $G$ is equal to the number of perfect matching of the corresponding graph $G_k$ on an even number of vertices divided by a suitable factor. If $G$ is bipartite then one can…

Computational Complexity · Computer Science 2016-08-31 Shmuel Friedland , Daniel Levy

In many multiagent environments, a designer has some, but limited control over the game being played. In this paper, we formalize this by considering incompletely specified games, in which some entries of the payoff matrices can be chosen…

Computer Science and Game Theory · Computer Science 2021-04-30 Markus Brill , Rupert Freeman , Vincent Conitzer

This paper, and its companion [BCLV24], are devoted to a negative resolution of the Aldous--Lyons Conjecture [AL07, Ald07]. In this part we study tailored non-local games. This is a subclass of non-local games -- combinatorial objects which…

Quantum Physics · Physics 2025-01-03 Lewis Bowen , Michael Chapman , Thomas Vidick

The statistics of local measurements of joint quantum systems can sometimes be used to distinguish the spatiotemporal structure in which they were measured. We first prove that every bipartite separable density matrix is temporally…

Quantum Physics · Physics 2026-01-05 Minjeong Song , Arthur J. Parzygnat

In this paper, we study nonzero-sum separable games, which are continuous games whose payoffs take a sum-of-products form. Included in this subclass are all finite games and polynomial games. We investigate the structure of equilibria in…

Computer Science and Game Theory · Computer Science 2010-04-26 Noah D. Stein , Asuman Ozdaglar , Pablo A. Parrilo

When applied to the same game, probability theory and game theory can disagree on calculated values of the Fisher information, the log likelihood function, entropy gradients, the rank and Jacobian of variable transforms, and even the…

Computer Science and Game Theory · Computer Science 2012-08-21 Michael J. Gagen

Combinatorial Game Theory is a branch of mathematics and theoretical computer science that studies sequential 2-player games with perfect information. Normal play is the convention where a player who cannot move loses. Here, we generalize…

Computer Science and Game Theory · Computer Science 2023-10-31 Prem Kant , Urban Larsson , Ravi K. Rai , Akshay V. Upasany

Projection games constitute an important class of nonlocal games where, for any answer from the first player, there is a unique correct answer for the second player. This class of games captures nonlocal games arising from constraint…

Quantum Physics · Physics 2026-03-17 Eric Culf

Departing from the usual paradigm of local operations and classical communication adopted in entanglement theory, here we study the interconversion of quantum states by means of local operations and shared randomness. A set of necessary and…

Quantum Physics · Physics 2012-05-18 Francesco Buscemi

In this paper we introduce a novel flow representation for finite games in strategic form. This representation allows us to develop a canonical direct sum decomposition of an arbitrary game into three components, which we refer to as the…

Computer Science and Game Theory · Computer Science 2015-03-17 Ozan Candogan , Ishai Menache , Asuman Ozdaglar , Pablo A. Parrilo

We introduce and study the class of semidefinite games, which generalizes bimatrix games and finite $N$-person games, by replacing the simplex of the mixed strategies for each player by a slice of the positive semidefinite cone in the space…

Optimization and Control · Mathematics 2024-05-21 Constantin Ickstadt , Thorsten Theobald , Elias Tsigaridas

Bilevel optimization problems involve two nested objectives, where an upper-level objective depends on a solution to a lower-level problem. When the latter is non-convex, multiple critical points may be present, leading to an ambiguous…

Optimization and Control · Mathematics 2022-10-18 Michael Arbel , Julien Mairal

In this work we focus on two classes of games: XOR nonlocal games and XOR* sequential games with monopartite resources. XOR games have been widely studied in the literature of nonlocal games, and we introduce XOR* games as their natural…

Quantum Physics · Physics 2024-02-06 Lorenzo Catani , Ricardo Faleiro , Pierre-Emmanuel Emeriau , Shane Mansfield , Anna Pappa

Control problems for embedded systems like cars and trains can be modeled by two-player hybrid games. Control envelopes, which are families of safe control solutions, correspond to nondeterministic winning policies of hybrid games, where…

Programming Languages · Computer Science 2025-08-11 Aditi Kabra , Jonathan Laurent , Stefan Mitsch , André Platzer

It was recently shown that the nonseparable density operators for a bipartite system are trace norm dense if either factor space has infinite dimension. We show here that non-local states -- i.e., states whose correlations cannot be…

Quantum Physics · Physics 2009-10-31 Rob Clifton , Hans Halvorson , Adrian Kent

A subclass of coded systems containing synchronized systems is the family of half-synchronized systems. In this note, we will consider them and show that the property half-synchronized lifts under hyperbolic maps. This enables us to define…

Dynamical Systems · Mathematics 2016-01-19 Somayyeh Jangjooye Shaldehi

We study the classical and quantum values of one- and two-party linear games, an important class of unique games that generalizes the well-known XOR games to the case of non-binary outcomes. We introduce a ``constraint graph" associated to…

Pursuing a new approach to the study of infinite games in combinatorics, we introduce the categories $\mathbf{Game}_{A}$ and $\mathbf{Game}_{B}$ and improve some classical results concerning topological games related to the duality between…

General Topology · Mathematics 2025-11-11 Matheus Duzi , Paul Szeptycki , Walter Tholen
‹ Prev 1 8 9 10 Next ›