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 ...

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. ...

We provide a pure Nash equilibrium existence theorem for games with discontinuous payoffs whose hypotheses are in a number of ways weaker than those of the theorem of Reny (1999). In comparison with Reny's argument, our ...

We prove the existence of monotonic pure strategy equilibrium for many kinds of asymmetric auctions with n bidders and unitary demands, interdependent values and independent types. The assumptions require monotonicity only ...

In the usual framework of continuum games with externalities, we substantially generalize Coumot-Nash existence results [Balder, A unifying approach to existence of Nash equilibria, Int. J.Game Theory 24 (1995) 79-94; On ...

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