21 citations · 75 across the 21 of their papers we have counts for
5 papers · 1 filter
Distributed Methods for Computing Approximate Equilibria
Artur Czumaj, Argyrios Deligkas, Michail Fasoulakis +3
We present a new, distributed method to compute approximate Nash equilibria in bimatrix games. In contrast to previous approaches that analyze the two payoff matrices at the same t…
Deterministic Communication in Radio Networks
Artur Czumaj, Peter Davies
In this paper we improve the deterministic complexity of two fundamental communication primitives in the classical model of ad-hoc radio networks with unknown topology: broadcastin…
Leader Election in Multi-Hop Radio Networks
Artur Czumaj, Peter Davies
In this paper we present a framework for leader election in multi-hop radio networks which yield randomized leader election algorithms taking in expec…
Communicating with Beeps
Artur Czumaj, Peter Davies
The \emph{beep model} is a very weak communications model in which devices in a network can communicate only via beeps and silence. As a result of its weak assumptions, it has broa…
Testing Cluster Structure of Graphs
Artur Czumaj, Pan Peng, Christian Sohler
We study the problem of recognizing the cluster structure of a graph in the framework of property testing in the bounded degree model. Given a parameter , a -bounde…