26 citations · 203 across the 41 of their papers we have counts for
3 papers · 1 filter
Wiretapping a hidden network
Haris Aziz, Oded Lachish, Mike Paterson +1
We consider the problem of maximizing the probability of hitting a strategically chosen hidden virtual network by placing a wiretap on a single link of a communication network. Thi…
Linear Complementarity Algorithms for Infinite Games
John Fearnley, Marcin Jurdziński, Rahul Savani
The performance of two pivoting algorithms, due to Lemke and Cottle and Dantzig, is studied on linear complementarity problems (LCPs) that arise from infinite games, such as parity…
Spanning connectivity games
Haris Aziz, Oded Lachish, Mike Paterson +1
The Banzhaf index, Shapley-Shubik index and other voting power indices measure the importance of a player in a coalitional game. We consider a simple coalitional game called the sp…