This paper proposes a multi-agent Q-learning algorithm called meta-game-Q learning that is developed from the meta-game equilibrium concept. Different from Nash equilibrium, meta-game equilibrium can achieve the optimal joint action game through deliberating its preference and predicting others’ policies in the general-sum game. A distributed negotiation algorithm is used to solve the meta-game...

The zero-sum matrix game is one of the most classic game models, and it is widely used in many scientific and engineering fields. In the real world, due to the complexity of the decision-making environment, sometimes the payoffs received by players may be inexact or uncertain, which requires that the model of matrix games has the ability to represent and deal with imprecise payoffs. To meet suc...

The Internet revolution has resulted in increased competition among providers of goods and services to lure customers by tearing down the barriers of time and distance. For example, a home buyer shopping for a mortgage loan through the Internet is now a potential customer for a large number of lending institutions throughout the world. The lenders (players, in generic game theory nomenclature) ...

We show that the following problem is EXP-complete: given a rational v and a two player, zero-sum Boolean gameG determine whether the value of G is at least v. The proof is via a translation of the proof of the same result for Boolean circuit games in [1]. 1 Preliminaries We will be using the encoding of [2] to replicate the proof of [1]. A familiarity with [2] will make the proof much easier t...