On Privatizing Equilibrium Computation in Aggregate Games over Networks

12/13/2019
by   Shripad Gade, et al.
0

We propose a distributed algorithm to compute an equilibrium in aggregate games where players communicate over a fixed undirected network. Our algorithm exploits correlated perturbation to obfuscate information shared over the network. We prove that our algorithm does not reveal private information of players to an honest-but-curious adversary who monitors several nodes in the network. In contrast with differential privacy based algorithms, our method does not sacrifice accuracy of equilibrium computation to provide privacy guarantees.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset