ABSTRACT
There are many ways to deliver academic and administrative computer services. Some imply competition and some imply cooperation. It is useful to discuss and analyze these situations in game-theory terms. To illustrate such an analysis, data from the University of New Hampshire are used.
- 1.Clark, J. D., 1979-80. "A Feature Analysis of Performance Evaluation Texts," Performance Evaluation Review (ACM SIGMETRICS), v. 8, n. 4, pp. 9-11,17. Google ScholarDigital Library
- 2.Stevens, D. F., 1980, "Obfuscatory Measurement: The State of the Art," Computerworld, v. 14, n. 20, May 19, pp. indepth/14-indepth/20.Google Scholar
- 3.Rapoport, A., 1970, N-Person Game Theory: Concepts and Applications, Ann Arbor: University of Michigan Press.Google Scholar
- 4.Rapoport, A., 1962, "The Use and Misuse of Game Theory," Scientific American, v. 207, n. 6, pp. 108-118.Google Scholar
Index Terms
- Academic and administrative computing as zero- and nonzero-sum games
Recommendations
Repeated zero-sum games with budget
AAMAS '12: Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2When a zero-sum game is played once, a risk-neutral player will want to maximize his expected outcome in that single play. However, if that single play instead only determines how much one player must pay to the other, and the same game must be played ...
Pure strategy equilibria in symmetric two-player zero-sum games
AbstractWe observe that a symmetric two-player zero-sum game has a pure strategy equilibrium if and only if it is not a generalized rock-paper-scissors matrix. Moreover, we show that every finite symmetric quasiconcave two-player zero-sum game has a pure ...
Comments