Computing the equilibrium point of games plays an important in computer science. A large number of methods are known for finding a Nash equilibrium. Nevertheless, Nash equilibrium can be adopted only for non-cooperative ...

In this paper we present a novel method for finding the strong Nash equilibrium. The approach consists on determining a scalar x* and the corresponding strategies d* ( x*) fixing specific bounds (min and max) that ...

In this paper, we consider a concept of local Nash equilibrium for non-cooperative games - the so-called weak local Nash equilibrium. We prove its existence for a significantly more general class of sets of strategies than ...

In this paper, we consider a concept of local Nash equilibrium for non-cooperative games - the so-called weak local Nash equilibrium. We prove its existence for a significantly more general class of sets of strategies than ...

In this paper, we study the calmness of a generalized Nash equilibrium problem (GNEP) with non-differentiable data. The approach consists in obtaining some error bound property for the KKT system associated with the ...

This is part of a larger project to investigate the Bayesian foundations of non-cooperative solution concepts. Elsewhere Bernheim and Pearce prove that common knowledge of Bayesian rationality is not enough to justify the ...

We introduce a condition, uniform payoff security, for games with compact Hausdorff strategy spaces and payoffs bounded and measurable in players' strategies. We show that if any such compact game G is uniformly payoff ...

In this paper, we present a general formulation for the deterministic traffic assignment problem, using an equivalent optimization problem applicable to the case of asymmetric linear cost functions. We present a resolution ...

We model strategic competition in a market with asymmetric information as a noncooperative game in which each firm competes for the business of a buyer of unknown type by offering the buyer a catalog of products and prices. ...