15 citations · 37 across the 13 of their papers we have counts for
18 papers
Discrete Incremental Voting: New Bounds for General Graphs and Expanders
Petra Berenbrink, Colin Cooper, Thorsten Götte +2
We analyze the discrete incremental voting process (DIV) introduced by Cooper, Radzik, and Shiraga [OPODIS '23]. In this process, we consider a set of nodes connected in an…
Asynchronous 3-Majority Dynamics with Many Opinions
Colin Cooper, Frederik Mallmann-Trenn, Tomasz Radzik +2
We consider 3-Majority, a probabilistic consensus dynamics on a complete graph with vertices, each vertex starting with one of initial opinions. At each discrete time step,…
Discrete Incremental Voting on Expanders
Colin Cooper, Tomasz Radzik, Takeharu Shiraga
Pull voting is a random process in which vertices of a connected graph have initial opinions chosen from a set of distinct opinions, and at each step a random vertex alters its…
New Bounds for Time-Dependent Scheduling with Uniform Deterioration
Angelos Gkikas, Dimitrios Letsios, Tomasz Radzik +1
Time-dependent scheduling with linear deterioration involves determining when to execute jobs whose processing times degrade as their beginning is delayed. Each job i is associated…
Discrete Incremental Voting
Colin Cooper, Tomasz Radzik, Takeharu Shiraga
We consider a type of pull voting suitable for discrete numeric opinions which can be compared on a linear scale, for example, 1 ('disagree strongly'), 2 ('disagree'), 5…
A simple model of influence
Colin Cooper, Nan Kang, Tomasz Radzik
We propose a simple model of influence in a network, based on edge density. In the model vertices (people) follow the opinion of the group they belong to. The opinion percolates do…