Uniformly supported approximate equilibria in families of games

نویسندگان

چکیده

This paper considers uniformly bounded classes of non-zero-sum strategic-form games with large finite or compact action spaces. The central class considered is assumed to be defined via a semi-algebraic condition. We show that for each ɛ>0, the support size required ɛ-equilibrium can taken uniform over entire class. As corollary, value zero-sum games, as function single-variable, well-behaved in limit. More generally, result only requires collection payoff functions considered, other players actions, have pseudo-dimension.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approximate Well-Supported Nash Equilibria in Symmetric Bimatrix Games

The ε-well-supported Nash equilibrium is a strong notion of approximation of a Nash equilibrium, where no player has an incentive greater than ε to deviate from any of the pure strategies that she uses in her mixed strategy. The smallest constant ε currently known for which there is a polynomial-time algorithm that computes an ε-well-supported Nash equilibrium in bimatrix games is slightly belo...

متن کامل

Approximate and Well-supported Approximate Nash Equilibria of Random Bimatrix Games

We focus on the problem of computing approximate Nash equilibria and well-supported approximate Nash equilibria in random bimatrix games, where each player's payoffs are bounded and independent random variables, not necessarily identically distributed, but with common expectations. We show that the completely mixed uniform strategy profile, i.e. the combination of mixed strategies (one per play...

متن کامل

Approximate strong equilibria in job scheduling games with two uniformly related machines

We consider approximate strong equilibria (SE) in strategic job scheduling games with two uniformly related machines. Jobs are assigned to machines, and each job wishes to minimize its cost, given by the completion time of the machine it is assigned to. Finding a Nash equilibrium (NE) in this game is simple. However, NE-configurations are not stable against coordinated deviations of several job...

متن کامل

Approximate Equilibria in Games with Few Players

We study the problem of computing approximate Nash equilibria (ǫ-Nash equilibria) in normal form games, where the number of players is a small constant. We consider the approach of looking for solutions with constant support size. It is known from recent work that in the 2-player case, a 1 2 -Nash equilibrium can be easily found, but in general one cannot achieve a smaller value of ǫ than 1 2 ....

متن کامل

Searching for Approximate Equilibria in Empirical Games

When exploring a game over a large strategy space, it may not be feasible or cost-effective to evaluate the payoff of every relevant strategy profile. For example, determining a profile payoff for a procedurally defined game may require Monte Carlo simulation or other costly computation. Analyzing such games poses a search problem, with the goal of identifying equilibrium profiles by evaluating...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Mathematical Economics

سال: 2022

ISSN: ['1873-1538', '0304-4068']

DOI: https://doi.org/10.1016/j.jmateco.2021.102571