This paper proposes a way to solve two sided incomplete information games which generally generates a unique equilibrium. Players in the games form conjectures about what other players want to do, starting from first order uninformative conjectures and keep updating with games theoretic and...

An information-theoretic thought experiment is developed to clarify why the maximum entropy methodology is appropriate for predicting the equilibrium state of economic systems. As a first step, object allocation problems, modeled as knapsack problems, are shown to be equivalent to congestion...

In part I of this paper, we proposed a Mixed-Integer Linear Program (MILP) to analyze imperfect competition of oligopoly producers in two-stage zonal power markets. In part II of this paper, we propose a solution algorithm which decomposes the proposed MILP model into several subproblems and...

This paper studies a new refinement for Perfect Bayesian equilibrium, Bayesian equilibrium by iterative conjectures (BEIC). BEIC requires players to make predictions, starting from first order uninformative predictive distribution functions (or conjectures) and keep updating with statistical...

Morton and Wecker (1977) stated that the value iteration algorithm solves a dynamic program's policy function faster than its value function when the limiting Markov chain is ergodic. I show that their proof is incomplete, and provide a new proof of this classic result. I use this result to...

This paper is a self-contained survey of algorithms for computing Nash equilibria of two-person games. The games may be given in strategic form or extensive form. The classical Lemke-Howson algorithm finds one equilibrium of a bimatrix game, and provides an elementary proof that a Nash...

Relaxation algorithms provide a powerful method of finding noncooperative equilibria in general synchronous games. Through use of the Nikaido-Isoda function, the Nash solution to a broad category of constrained, multiplayer, non-zerosum games can easily be found. We provide solutions to some...

In this note we generalize a numerical algorithm presented in [9] to calculate all solutions of the scalar algebraic Riccati equations that play an important role in finding feedback Nash equilibria of the scalar N-player linear affine-quadratic differential game. The algorithm is based on...

This paper tries to connect the theory of genetic algorithm (GA) learning to evolutionary game theory. It is shown that economic learning via genetic algorithms can be described as a specific form of evolutionary game. It will be pointed out that GA learning results in a series of near Nash...