Let us start by fixing some notation. In a two-player game, let p be an efficiently computable correlated equilibrium that the players know and aim to generate. A typical scenario is that p is the lexicographically first correlated equilibrium that …

A correlated equilibrium is a fundamental solution concept in game theory that enjoys many desirable properties. However, it requires a trusted media…

Pavlovian Population protocols are symmetric. We just proved that they have a very limited computational power. However, assuming population protocols symmetric (not-necessarily Pavlovian) is not truly a restriction.

Population protocols have been introduced by Angluin et {al.} as a model of networks consisting of very limited mobile agents that interact in pairs …

We provide a general method to prove the existence and compute efficiently elimination orderings in graphs. Our method relies on several tools that w…

The problem of dictionary matching is a classical problem in string matching: given a set S of d strings of total length n characters over an (not ne…

" How well connected is the network? " This is one of the most fundamental questions one would ask when facing the challenge of designing a communica…

We have compared three models of randomized strategies —behavioural, mixed, and general— in the context of graph games. Depending on the sub-case, we were able to expose variations in the amount of memory needed, the existence of finite-memory strat…

Graph games of infinite length are a natural model for open reactive processes: one player represents the controller, trying to ensure a given specif…

We conclude the paper with some open questions.

We define a new class of languages of $\omega$-words, strictly extending $\omega$-regular languages. One way to present this new class is by a type…

An ancestry labeling scheme assigns labels (bit strings) to the nodes of rooted trees such that ancestry queries between any two nodes in a tree can …

Generating functions for plane overpartitions are obtained using various methods such as nonintersecting paths, RSK type algorithms and symmetric fun…

A graph is a $k$-leaf power of a tree $T$ if its vertices are leaves of $T$ and two vertices are adjacent in $T$ if and only if their distance in $T$…

In [{Structural properties and decomposition of linear balanced matrices}, {\it Mathematical Programming}, 55:129--168, 1992], Conforti and Rao conje…

We proved that predicates on counts of input agents n≥0, n=0, n≥m, where n,m are some counts of input agents, can be computed by some Pavlovian population protocols.

Population protocols have been introduced as a model of sensor networks consisting of very limited mobile agents with no control over their own movem…

Motivated by multiplication algorithms based on redundant number representations, we study representations of an integer $n$ as a sum $n=\sum_k \epsi…

Introduced in the late 1960's, the asymmetric exclusion process (ASEP) is an important model from statistical mechanics which describes a system of i…

We generalize the classical cow-path problem [7, 14, 38, 39] into a question that is relevant for collective foraging in animal groups. Specifically,…

Consider an infinite graph with nodes initially labeled by independent Bernoulli random variables of parameter p. We address the density classificati…

An \emph{s-graph} is a graph with two kinds of edges: \emph{subdivisible} edges and \emph{real} edges. A \emph{realisation} of an s-graph $B$ is any …

In this Section, we show a 3/4 lower bound for classical bit commitment schemes when players additionally have the power to perform perfect (strong or weak) coin-flipping. This will show that unlike strong coin flipping, quantum and classical bit co…

Bit commitment is a fundamental cryptographic primitive with numerous applications. Quantum information allows for bit commitment schemes in the info…

Let C be a finite set of $N elements and R = {R_1,R_2, ..,R_m} a family of M subsets of C. The family R verifies the consecutive ones property if the…

Similarly to $\beta$-adic van der Corput sequences, abstract van der Corput sequences can be defined for abstract numeration systems. Under some assu…

By signing up you accept our content policy

Already have an account? Sign in

No a member yet? Create an account