Under full substitutability of preferences, it has been shown that a competitive equilibrium exists in trading networks, and is equivalent (after a restriction to equilibrium trades) to (chain) stable outcomes. In this paper, we formulate the problem of finding an efficient outcome as a...

We provide conditions that simplify applying Reny's (1999) better-reply security to Bayesian games, and use these conditions to prove the existence of equilibria for classes of games in which payoff discontinuities arise only at "ties." These games include a general version of all-pay contests,...

For an increasing upper order hemi-continuous correspondence F selfmapping sigma-complete lattice A, we first provide tight fixed-point bounds for sufficiently large iterations on F starting from any initial point a in A. We use this result for conducting iterative fixed-point comparative...

We provide conditions that simplify applying Reny's (1999) better-reply security to Bayesian games and use these conditions to prove the existence of equilibria for classes of games in which payoff discontinuities arise only at “ties.” These games include a general version of all-pay...