Related papers: Uniform Partition in Population Protocol Model und…
The quantum marginal problem consists in deciding whether a given set of marginal reductions is compatible with the existence of a global quantum state or not. In this work, we formulate the problem from the perspective of dynamical systems…
This research seeks to benefit the software engineering society by providing a simple yet effective pre-processing approach to achieve equalized odds fairness in machine learning software. Fairness issues have attracted increasing attention…
Bipartite matching, where agents on one side of a market are matched to agents or items on the other, is a classical problem in computer science and economics, with widespread application in healthcare, education, advertising, and general…
Given the widespread popularity of spectral clustering (SC) for partitioning graph data, we study a version of constrained SC in which we try to incorporate the fairness notion proposed by Chierichetti et al. (2017). According to this…
Population protocols (Angluin et al., PODC, 2004) are a formal model of sensor networks consisting of identical mobile devices. Two devices can interact and thereby change their states. Computations are infinite sequences of interactions…
Capacitated fair-range $k$-clustering generalizes classical $k$-clustering by incorporating both capacity constraints and demographic fairness. In this setting, each facility has a capacity limit and may belong to one or more demographic…
Recent advancements in bipartite consensus, a scenario where agents are divided into two disjoint sets with agents in the same set agreeing on a certain value and those in different sets agreeing on opposite or specifically related values,…
We study bipartite community detection in networks, or more generally the network biclustering problem. We present a fast two-stage procedure based on spectral initialization followed by the application of a pseudo-likelihood classifier…
We study the random K-satisfiability problem using a partition function where each solution is reweighted according to the number of variables that satisfy every clause. We apply belief propagation and the related cavity method to the…
In this paper, we present, to our knowledge, the first known I/O efficient solutions for computing the k-bisimulation partition of a massive directed graph, and performing maintenance of such a partition upon updates to the underlying…
Hedonic games model settings in which a set of agents have to be partitioned into groups which we call coalitions. In the enemy aversion model, each agent has friends and enemies, and an agent prefers to be in a coalition with as few…
The aim of the paper is to introduce general techniques in order to optimize the parallel execution time of sorting on a distributed architectures with processors of various speeds. Such an application requires a partitioning step. For…
Our work is devoted to the metric facility location problem and addresses the selfish behavior of the players. It contributes to the line of work initiated by Procaccia and Tennenholtz [EC09] on approximate mechanism design without money.…
Classical clustering problems such as \emph{Facility Location} and \emph{$k$-Median} aim to efficiently serve a set of clients from a subset of facilities -- minimizing the total cost of facility openings and client assignments in Facility…
The accurate identification of faulty hardware is a fundamental requirement for reliable quantum information processing. We address this problem in a quantum setting, where a series of $n$ devices is intended to apply the same unitary…
We are given n base elements and a finite collection of subsets of them. The size of any subset varies between p to k (p < k). In addition, we assume that the input contains all possible subsets of size p. Our objective is to find a…
A fundamental problem in quantum physics is to establish whether a multiparticle quantum state can be uniquely determined from its local marginals. In theory, this problem has been addressed in the exact case where the marginals are…
We study population protocols: networks of anonymous agents that interact under a scheduler that picks pairs of agents uniformly at random. The _size counting problem_ is that of calculating the exact number $n$ of agents in the population,…
Efficient verification of multipartite quantum states is crucial to many applications in quantum information processing. By virtue of Schmidt decomposition and mutually unbiased bases, here we propose a universal protocol to verify…
We investigate unitary and state $t$-designs from a computational complexity perspective. First, we address the problems of computing frame potentials that characterize (approximate) $t$-designs. We present a quantum algorithm for computing…