Computing Equilibria in Anonymous Games

Details Computing Equilibria in Anonymous Games Computing Equilibria in Anonymous Games

2007-10-30

arxiv.org/abs/0710.5582v1

Computer Science

Computer Science and Game Theory

Scientific paper

We present efficient approximation algorithms for finding Nash equilibria in anonymous games, that is, games in which the players utilities, though different, do not differentiate between other players. Our results pertain to such games with many players but few strategies. We show that any such game has an approximate pure Nash equilibrium, computable in polynomial time, with approximation O(s^2 L), where s is the number of strategies and L is the Lipschitz constant of the utilities. Finally, we show that there is a PTAS for finding an epsilon

Affiliated with

Also associated with

No associations

Rating

Computing Equilibria in Anonymous Games does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Computing Equilibria in Anonymous Games, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing Equilibria in Anonymous Games will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-365016