Title :
A Zermelo algorithm solving deterministic graph games with average payoff
Author_Institution :
Dept. of Math., London Sch. of Econ., UK
Abstract :
Consideration is given to general non-zero-sum games where a recursive procedure produces a special Nash equilibrium, called the Z-solution. All the examples have been created to fit two people
Keywords :
game theory; Nash equilibrium; Z-solution; Zermelo algorithm; average payoff; deterministic graph games; game theory; non-zero-sum games; Application specific processors; Dissolved gas analysis; Electronics packaging; Game theory; Minimax techniques; Radio access networks; Read only memory; Stochastic processes;
Conference_Titel :
Decision and Control, 1989., Proceedings of the 28th IEEE Conference on
Conference_Location :
Tampa, FL
DOI :
10.1109/CDC.1989.70616
