Related papers: Multiplayer Parallel Repetition Is the Same as Hig…
Over the last two decades, frameworks for distributed-memory parallel computation, such as MapReduce, Hadoop, Spark and Dryad, have gained significant popularity with the growing prevalence of large network datasets. The Massively Parallel…
Combinatorial optimization algorithms for graph problems are usually designed afresh for each new problem with careful attention by an expert to the problem structure. In this work, we develop a new framework to solve any combinatorial…
Despite there being significant work on developing spectral, and metric embedding based approximation algorithms for hypergraph generalizations of conductance, little is known regarding the approximability of hypergraph partitioning…
High-dimensional multiplex graphs are characterized by their high number of complementary and divergent dimensions. The existence of multiple hierarchical latent relations between the graph dimensions poses significant challenges to…
We analyze Avoider-Enforcer games played on edge disjoint hypergraphs, providing an analog of the classic and well known game $Box$, due to Chv\'{a}tal and Erd\H{o}s. We consider both strict and monotone versions of Avoider-Enforcer games,…
Correlated equilibria are a fundamental solution concept in game theory. However, despite decades of research, the complexity beyond games of polynomial type -- such as extensive-form games, congestion or routing games, and more broadly…
We study variations of classical combinatorial games on two finite heaps of tokens, a.k.a. \emph{subtraction games}. Given non-negative integers $p_1,q_1, p_2,q_2$, where $p_1q_2 > q_1p_2$, $p_1>0$ and $q_2>0$, two players alternate in…
In this article, we study the repeated routing game problem on a parallel network with affine latency functions on each edge. We cast the game setup in a LQR control theoretic framework, leveraging the Rosenthal potential formulation. We…
A multigraph G is said to be an (s,q)-graph if every s-set of vertices in G supports at most q edges (counting multiplicities). In this paper we consider the maximal sum and product of edge multiplicities in an (s,q)-graph on n vertices.…
All-pairs similarity problem asks to find all vector pairs in a set of vectors the similarities of which surpass a given similarity threshold, and it is a computational kernel in data mining and information retrieval for several tasks. We…
The field of deep learning has witnessed a remarkable shift towards extremely compute- and memory-intensive neural networks. These newer larger models have enabled researchers to advance state-of-the-art tools across a variety of fields.…
The behavior of games repeated in parallel, when played with quantumly entangled players, has received much attention in recent years. Quantum analogues of Raz's classical parallel repetition theorem have been proved for many special…
The super edge-magicness of graphs of equal order and size has been shown to be important since such graphs can be used as seeds to answer many questions related to (super) edge-magic labelings and other types of well studied labelings, as…
In practice symmetries of combinatorial structures are computed by transforming the structure into an annotated graph whose automorphisms correspond exactly to the desired symmetries. An automorphism solver is then employed to compute the…
Finding patterns in large highly connected datasets is critical for value discovery in business development and scientific research. This work focuses on the problem of subgraph matching on streaming graphs, which provides utility in a…
Inspired by asynchronous cooperative Parrondo's games we introduce two new types of games in which all players simultaneously play game A or game B or a combination of these two games. These two types of games differ in the way a…
This paper presents an efficient parallel approximation scheme for a new class of min-max problems. The algorithm is derived from the matrix multiplicative weights update method and can be used to find near-optimal strategies for…
We examine a number of results of infinite combinatorics using the techniques of reverse mathematics. Our results are inspired by similar results in recursive combinatorics. Theorems included concern colorings of graphs and bounded graphs,…
Many classical theorems in combinatorics establish the emergence of substructures within sufficiently large collections of objects. Well-known examples are Ramsey's theorem on monochromatic subgraphs and the Erd\H{o}s-Rado sunflower lemma.…
We present a definition of the class NP in combinatorial context as the set of languages of structures defined by finitely many forbidden lifted substructures. We apply this to special syntactically defined subclasses and show how they…