Papers by Reif on Complexity of Games (5 papers)
1.
John H. Reif,
Universal Games of Incomplete Information. 11th
Annual ACM Symposium on Theory of Computing, Atlanta, GA, April 1979, pp.
288-308. [PDF]
Harvard University TR-35-81. Published as The Complexity of Two Player Games of
Incomplete Information. Journal of
Computer and System Sciences, Vol. 29, No. 2, October 1984, pp. 274-301. [PDF]
4. Gary L. Peterson and John H. Reif, Decision Algorithms for Multiplayer Games of Incomplete Information. Harvard University, TR-34-81. Published as Gary L. Peterson, John H. Reif, and Selman Azhar, Decision Algorithms for Multiplayer Non-Cooperative Games of Incomplete Information. Computers and Mathematics with Applications, Vol. 43, Jan. 2002, pp. 179-206. [PDF]
5. Selman Azhar, Andrew McLennan and John H. Reif, Computation of Equilibria in Noncooperative Games, Duke University Technical Report CS-1991-36. Proc. Workshop for Computable Economics, Dec. 1992. Published in Computers & Mathematics with Applications, Volume 50, Issues 5-6, September 2005, pp. 823-854. [PDF]