Chapter 38 Game-theoretic aspects of computing

Handbook of Game Theory with Economic Applications

Volumn 2, Issue , 1994, Pages 1339-1395

  Linial, Nathan ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 70350100693     PISSN: 15740005     EISSN: None     Source Type: Book Series    
DOI: 10.1016/S1574-0005(05)80070-0     Document Type: Review

References (142)

1. Afek Y., Awerbuch B., and Gafni E. Applying static network protocols to dynamic networks. Proceedings of the 28th IEEE Symposium on the Foundations of Computer Science (1987) 358-370
2. Aho A.V., Hopcroft J.E., and Ullman J.D. The design and analysis of computer algorithms (1974), Addison-Wesley
3. Ajtai M., and Fagin R. Reachability is harder for directed than for undirected finite graphs. Journal of Symbolic Logic 55 (1990) 113-150
4. Ajtai M., and Linial N. The influence of large coalitions. Combinatorica 13 (1993) 129-145
5. to appear. Alon N., and Naor M. Coin-flipping games immune against linear-sized coalitions. Proceedings of the 31st IEEE Symposium on the Foundations of Computer Science. SIAM Journal of Computing (1990) 46-54
6. Alon N., and Spencer J. The probabilistic method (1992), Wiley-Interscience
7. Axelrod R. The evolution of cooperation (1984), Basic Books, New York
8. Axelrod R., and Dion D. The further development of cooperation. Science 242 (1988) 1385-1390
9. Babai L. Trading group theory for randomness. Proceedings of the 27th IEEE Symposium on the Foundations of Computer Science (1986) 368-379
10. Barany I., and Furedi Z. Mental poker with three or more players. Information and Control 59 (1983) 84-93
11. Bar-Noy A., Dolev D., Dwork C., and Strong R. Shifting gears: Changing algorithms on the fly to expedite Byzantine Agreement. Proceedings of the 6th Annual ACM Symposium on Principles of Distributed Computing (1987) 42-51
12. Beckner W. Inequalities in Fourier analysis. Annals of Mathematics 102 (1975) 159-182
13. Ben-David S., Borodin A., Karp R., Tardos G., and Wigderson A. On the power of randomization in online algorithms. Proceedings of the 22nd Annual ACM Symposium on Theory of Computing (1990) 379-386
14. Ben-Or M. Another advantage of free choice: Completely asynchronous agreement protocols. Proceedings of the 2nd Annual ACM Symposium on Principles of Distributed Computing (1983) 27-30
15. Ben-Or M., Godwasser S., and Wigderson A. Completeness theorems for non-cryptographic fault-tolerant distributed computation. Proceedings of the 20th Annual ACM Symposium on Theory of Computing (1988) 1-10
16. Ben-Or M., and Linial N. Collective coin flipping. In: Micali S. (Ed). Randomness and computation (1989), Academic Press 91-115
17. Early version. Ben-Or M., and Linial N. Collective coin flipping, robust voting games and minima of Banzhaf values. Proceedings of the 26th IEEE Symp. on the Foundations of Computer Science (1985) 408-416
18. No. 52. Combinatorics, Eger. Ben-Or M., Linial N., and Saks M. Collective coin flipping and other models of imperfect information. Colloquim of the Mathematical Society Janos Bolyai (1987) 75-112
19. Berlekamp E.R., Conway J.H., and Guy R.K. Winning ways for your mathematical play (2 vols.) (1982), Academic Press
20. 1991. Berman P., and Garay J. Efficient distributed consensus with n = (3 + ε)t processors. Proceedings of the 5th International Workshop on Distributed Algorithms, LNCS (1991), Springer-Verlag
21. Bollobas B. Combinatorics (1986), Cambridge University Press
22. Boppana R.B., and Narayanan B.O. The biased coin problem. Proceedings of the 25th ACM Symposium on Theory of Computing (1993) 252-257
23. manuscript, May 1993. Boppana R.B., and Narayanan B.O. Collective coin flipping and leader election with optimal immunity (1993)
24. Boppana R.B., and Sipser M. The complexity of finite functions. In: van Leeuwen J. (Ed). Handbook of theoretical computer science Vol. A (1990), The MIT Press/Elsevier 757-804
25. Borodin A., Linial N., and Saks M. Online task systems. SIAM Journal on Computing 18 (1989) 268-277
26. Borowsky E., and Gafni E. Generalized FLP impossibility results for t-resilient asynchronous computations. Proceedings of the 25th ACM Symposium on Theory of Computing (1993) 91-100
27. Bourgain J., Kahn J., Kalai G., Katznelson Y., and Linial N. The influence of variables in product spaces. Israel Journal of Mathematics 77 (1992) 55-64
28. Bracha G. An O(log n) expected rounds randomized Byzantine generals protocols. Journal of ACM 32 (1985) 824-840
29. Chaum D., Crepeau C., and Damgaard I. Multiparty unconditionally secure protocols. Proceedings of the 20th Annual ACM Symposium on Theory of Computing (1988) 11-19
30. Chor B., and Dwork C. Randomization in Byzantine Agreement. In: Micali S. (Ed). Randomness and computation (1989), Academic Press 443-497
31. Chor B., and Gerèb-Grauss M. On the influence of single participants in coin flipping schemes. SIAM Journal of Discrete Mathematics 1 (1988) 411-415
32. in press; Proceedings of the 30th IEEE Conference on Foundation of Computer Science. Chor B., Geréb-Grauss M., and Kushilevitz E. Private computations over the integers. SIAM Journal on Computing (1990) 335-344
33. Chor B., and Goldreich O. Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM Journal on Computing 17 (1988) 230-261
34. Chor B., Goldwasser S., Micali S., and Awerbuch B. Verifiable secret sharing and achieving simultaneity in the presence of faults. Proceedings of the 26th IEEE Conference Foundation of Computer Science (1985) 383-395
35. Chor B., and Kushilevitz E. A zero-one law for Boolean privacy. SIAM Journal on Discrete Mathematics 4 (1991) 36-47
36. Condon A. Computational Models of Games. ACM Distinguished Dissertation Series (1988), The MIT Press
37. Condon A. The complexity of stochastic games. Information and Computation 96 (1989) 203-224
38. Cooper J., and Linial N. Fast perfect-information leader election protocols with linear immunity. 25th Symposium on the Theory of Computing (1993) 662-671
39. Cover, T.M. Universal Portfolio's. Technical Report No. 66 (July 1988), Department of Statistics, Stanford University
40. Dean T., and Boddy M. An analysis of time-dependent planning. Proceedings of the Seventh National Conference on Artificial Intelligence. 1988 (1988) 49-54
41. unpublished manuscript. Deng X., and Papadimitriou C.H. On the complexity of cooperative solution concepts (1987)
42. Diffie W., and Hellman M.E. New directions in cryptography. IEEE Transactions on Information Theory 22 (1976) 644-654
43. Doyle J. Rationality and its roles in reasoning (Extended Abstract). Proceedings of the Eighth National Conference on Artificial Intelligence (1990) 1093-1100
44. Dubiner, M. (1986) private communication.
45. Dwork C., Peleg D., Pippenger N., and Upfal E. Fault tolerance in networks of bounded degree. SIAM Journal on Computing 17 (1988) 975-988
46. Dym H., and McKean H.P. Fourier series and integrals (1972), Academic Press
47. Ehrenfeucht A. An application of games to the completeness problem for formalized theories. Foundamenta Mathematica 49 (1961) 129-141
48. El-Yaniv R., and Karp R.M. The mortgage problem. Proceedings of the 2nd Israel Symposium on Theory and Computing Systems (1993) 304-312
49. Fagin, R., J.Y. Halpern, Y. Moses and M.Y. Vardi (to appear) Reasoning about knowledge.
50. Feldman, P. (1986) privated communication.
51. Feldman J.A., and Sproull R.F. Decision theory and Artificial Intelligence II: The Hungry Monkey. Cognitive Science 1 (1977) 158-192
52. Feldman P., and Micali S. Optimal algorithms for Byzantine Agreement. Proceedings of the 20th Annual ACM Symposium on Theory of Computing (1988) 148-161
53. Fiat A., Rabani Y., and Ravid Y. Competitive k-serve algorithms. 31st Sysmposium on the Foundations of Computer Science (1990) 454-463
54. Fischer M.J. The concensus problem in unreliable distributed systems (a brief survey). Technical Report (1983), Department of Computer Science, Yule University
55. Fischer M.J., Lynch N.A., and Merritt M. Easy impossibility proofs for distributed consensus problems. Distributed Computing 1 (1986) 26-39
56. Fischer M.J., Lynch N.A., and Patterson M. Impossibility of distributed concensus with one faulty processor. Journal of ACM 32 (1985) 374-382
57. Foster D.P., and Vorha R.V. On combining forecasts. Technical Report (1987), Ohio State University
58. Futia C. The complexity of economic decision rules. Journal of Mathematical Economics 4 (1977)
59. Garay J.A., and Moses Y. Fully polynomial Byzantine Agreement in t + 1 rounds. Proceedings of the 25th ACM Symposium on Theory of Computing (1993) 31-41
60. Garey M.R., and Johnson D.S. Computers and interactability - a guide to the theory of NP-completencess (1979), Freeman
61. Geanakopolos, J. Common knowledge, Chapter 40, this Handbook.
62. Genesereth M.R., and Rosenschein J.S. Cooperation without communication. In: Bond A.H., and Gasser L. (Eds). Readings in distributed artificial Intelligence (1988), Morgan Kaufmann Publishers, Inc., San Mateo, CA 227-234
63. Gilboa I., and Zemel E. Nash and correlated equilibria: Some complexity considerations. Games and Economic Behavior 1 (1989)
64. Goldreich O. Randomness, interactive proofs and zero-knowledge - A survey. In: Herken R. (Ed). The universal Turing Machine, a half century survey (1988), Kammerer and Univerzagt, Hamburg Berlin 377-405
65. Goldreich O. Foundations of cryptography. Class Notes (1989), Computer Science Department, Technion
66. Goldreich O., Goldwasser S., and Linial N. Fault-tolerant computation in the full information model. 32nd Symposium on the Foundations of Computer Science (1991) 447-457
67. Goldreich O., and Levin L.A. A hard-core predicate for all one-way functions. Proceedings of the 21st ACM Symposium on Theory of Computing (1989) 25-32
68. Goldreich O., Micali S., and Wigderson A. Proofs that yield nothing but their validity, or all languages in NP have zero-knowledge proofs. Journal of ACM 38 (1991) 691-729
69. 27th Symposium on the Foundations of Computer Science (1986) 174-187
70. Goldreich O., Micali S., and Wigderson A. How to play any mental game, or, a completeness theorem for protocols with honest majority. Proceedings of the 19th ACM Symposium on Theory of Computing (1987) 218-229
71. Goldreich O., and Petrank E. The best of both worlds: guaranteeing termination in fast randomized Byzantine Agreement protocols. Information Processing Letters 36 (1990) 45-49
72. Goldwasser S., and Micali S. Probabilistic encryption. Journal on Computer and System Science 28 (1984) 270-299
73. Goldwasser S., Micali S., and Rackoff C. The knowledge complexity of interactive proof systems. SIAM Journal on Computing 18 (1988) 186-208
74. Graham R.L., and Yao A.C. On the improbability of reaching Byzantine Agreements. Proceedings of the 21st ACM Symposium on Theory of Computing (1989) 467-478
75. Gurevich Y., and Harrington L. Trees, automata and games. Proceedings of the 14th ACM Symposium on Theory of Computing (1982) 60-65
76. Halpern J.Y., and Moses Y. Knowledge and common knowledge in a distributed environment. Journal of ACM 37 (1990) 549-587
77. Hardy G.H., and Wright E.M. An introduction to the theory of numbers. 5th edn. (1979), Oxford Univeristy Press, Haifa, Israel
78. Hart S. A note on the edges of the n-cube. Discrete Mathematics 14 (1976) 157-163
79. Hastad J. Pseudo-random generators under uniform assumptions. Proceedings of the 22nd ACM Symposium on Theory of Computing (1990) 395-404
80. Herlihy M., and Shavit N. The asynchronous computability theorem for t-resilient tasks. Proceedings of the 25th ACM Symposium on Theory of Computing (1993) 111-120
81. Hodges W. Building models by games (1985), Cambridge University Press
82. Horvitz E.J. Reasoning under varying and uncertain resource constraints. Proceedings of the Seventh National Conference on Artificial Intelligence (1988) 111-116
83. Impagliazzo R., Levin L.A., and Luby M. Pseudo-random generation from one-way functions. Proceedings of the 21st ACM Symposium on Theory of Computing (1989) 12-24
84. Johnson D.S. A catalog of commplexity classes. In: van Leeuwen J. (Ed). Handbook of theoretical computer science Vol. A (1990), The MIT Press/Elsevier 67-161
85. Kahn J., Kalai G., and Linial N. The influence of variables on Boolean functions. 29th Symposium on the Foundations of Computer Science (1988) 68-80
86. Kalai E. Bounded rationality and strategic complexity in repeated games. In: Ichiishi T., Neyman A., and Tauman Y. (Eds). Game theory and applications (1990), Academic Press 131-157
87. Karchmer M., and Wigderson A. Monotone circuits for connectivity require superlogarithmic depth. SIAM Journal of Discrete Mathmatics 3 (1990) 255-265
88. Knuth D. The art of computer programming (3 vols.) (1973), Addison-Wesley
89. Knuth D.E., and Moore R.N. An analysis of the alpha-beta pruning. Artificial Intelligence 6 (1975) 293-322
90. Koller D., and Megiddo N. The complexity of two-person zero-sum games in extensive form. Games and Economic Behavior 4 (1992) 528-552
91. to appear. Koller D., and Megiddo N. Finding mixed strategies with small supports in extensive form games. Research Report RJ 8380 (1991), IBM Almaden Research Center. International Journal of Game Theory
92. Kraus S., Ephrati E., and Lehmann D. Negotiation in a non-cooperative environment. Journal of Experimental and Theoretical Artificial Intelligence 4 (1991) 255-282
93. Kraus S., and Wilkenfeld J. Negotiations over time in a multi-agent environment: Preliminary report. Proceedings of the Twelfth International Joint Conference on Artificial Intelligence (1991) 56-61
94. Kushilevitz E., and Mansour Y. Learning decision trees using the Fourier spectrum. Proceedings of the 23rd Annual ACM Symposium on Theory of Computing (1991) 455-464
95. Lamport L., Shostak R., and Pease M. The Byzantine generals problem. ACM TOPLAS 4 (1982) 382-401
96. Lenstra A.K., and Lenstra Jr. H.W. Algorithms in number theory. In: van Leeuwen J. (Ed). Handbook of theoretical computer science Vol. A (1990), The MIT Press/Elsevier 673-715
97. Lewis H.R., and Papadimitriou C.H. Elements of the theory of computation (1981), Prentice Hall
98. Lichtenstein D., Linial N., and Saks M. Some extremal problems arising from discrete control processes. Combinatorica 9 (1989) 269-287
99. Loomis L., and Whitney H. An inequality related to the isoperimetric inequality. Bulletin of the American mathematical Society 55 (1949) 961-962
100. Lovasz L. Communication complexity: A survey. In: Korte B., Lovasz L., Prömel H.J., and Schrijver A. (Eds). Paths, flows and VLSI layout (1990), Springer 235-265
101. Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer, Science, 16-25. Lund C., Fortnow L., Karloff H., and Nisan N. Algebraic methods for interactive proof systems. Journal of ACM 39 4 (1992) 855-868
102. MacWilliams J., and Sloane N. The theory of error correcting codes (1977), North-Holland
103. McGeoch L.A., and Sleator D.D. Workshop on On-Line Algorithms. DIMACS Series in Discrete Mathematics and Theoretical Computer Science Vol. 7 (1991), American Mathematical Society
104. Mahmond E. Accuracy in forecasting: A survey. J. Forecasting 3 (1984) 139-159
105. Manasse M.S., McGeoch L.A., and Sleator D.D. Competitive algorithms for server problems. J. Algorithms 11 (1990) 208-230
106. Megiddo N. On the complexity of linear programming. In: Bewley T. (Ed). Advances in economic theory fifth world congress (1987), Cambridge University Press, Cambridge 225-268
107. Megiddo N. On probabilistic machines, bounded rationality, and average-case complexity. Research Report RJ 7039 (1989), IBM Almaden Research Center
108. Megiddo N., and Wigderson A. On play by means of computing machines. In: Halpern J.Y. (Ed). Theoretical aspects of reasoning about knowledge (1986), Morgan Kaufmann Publishers, Inc., Los Altos, CA 259-274
109. Menger K. Zur allgemeinen Kurventheorie. Fundamenta Mathematica 10 (1927) 95-115
110. Moses Y., Dolev D., and Halpern J.Y. Cheating husbands and other stories: a case study of knowledge, action, and communication. Distributed Computing 1 (1986) 167-176
111. Moses Y., and Waartz O. Coordinated transversal: (t + 1)-round Byzantine Agreement in polynomial time. Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science (1988) 246-255
112. Mosschovakis Y.N. Descriptive set theory (1980), North-Holland, Amsterdam
113. Naor M. Bit commitment using pseudorandomness. Journal of Cryptology 4 2 (1991) 151-158
114. Owen G. Game theory. 2nd ed. (1982), Academic Press, New York
115. Papadimitriou C. Games against nature. Journal of Compouting System Science 31 (1985) 288-301
116. Pearl J. Heuristics: intelligent search strategies for computer solving problems (1984), Addison-Wesley
117. Pease M., Shostak R., and Lamport L. Reaching agreement in the presence of faults. Journal of ACM 27 (1980) 228-234
118. Rabin M.O. Decidability of second-order theories and automata on infinite trees. Transactions of the AMS 141 (1969) 1-35
119. Rabin M.O. Probabilistic algorithms. In: Traub J. (Ed). Algorithms and complexity (1976), Academic Press 21-39
120. Rabin M.O. Randomized Byzantine generals. Proceedings of the 24th Annual IEEE Symposium on Foundations of Computer Science (1983) 403-409
121. Rabin T., and Ben-or M. Verifiable secret sharing and multiparty protocols with honest majority. Proceedings of the 21st Annual ACM Symposium on Theory of Computing (1989) 73-85
122. Rivest R. Cryptography. In: van Leeuwen J. (Ed). Handbook of theoretical computer science Vol. A (1990), The MIT Press/Elsevier 719-755
123. Rosenschein J.S., and Genesereth M.R. Deals among rational agents. In: Huberman B.A. (Ed). The ecology of computation (1988), North-Holland 117-132
124. Russell S., and Wefald E. Do the right thing (1991), MIT Press
125. Saks M. A robust noncryptographic protocol for collective coin flipping. SIAM Journal of Discrete Mathematics 2 (1989) 240-244
126. Saks M., and Wigderson A. Probabilistic decision trees and the complexity of evaluating game trees. Proceedings of the 26th Annual IEEE Symposium on Foundations of Computer Science (1985) 29-38
127. Saks M., and Zaharoglou F. Wait-free k-set agreement is impossible: The topology of public knowledge. Proceedings of the 25th ACM Symposium on Theory of Computing (1993) 101-110
128. Santha M., and Vazirani U.V. Generating quasi-random sequences from semi-random sources. Journal of Computer and System Science 33 (1986) 75-87
129. Shamir A. How to share a secret. Communications of the ACM 22 (1979) 612-613
130. Shamir A. IP=PSPACE. Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science (1990) 11-15
131. Simon, H.A. and J. Schaeffer, The game of chess, Chapter 1, this Handbook.
132. Sleator D., and Tarjan R.E. Amortized efficiency of list update and paging rules. Communication of ACM 28 (1985) 202-208
133. Sorin, S. Repeated games with complete information, Chapter 4, this Handbook.
134. Tarsi M. Optimal search on some game trees. Journal of ACM 30 (1983) 389-396
135. Vazirani U.V. Randomness, adversaries and computation. PhD Thesis (1986), U. C. Berkeley
136. Vazirani U.V., and Vazirani V.V. Random polynomial time is equal to semi-random polynomial time. Proceedings of the 26th Annual IEEE Symposium on Foundations of Computer Science (1985) 417-428
137. Yao A.C. Probabilistic computation: Towards a unified measure of complexity. Proceedings of the 18th Annual IEEE Symposium on Foundations of Computer Science (1977) 222-227
138. Yao A.C. Some complexity questions related to distributed computing. Proceedings of the 11th Annual ACM Symposium on Theory of Computing (1979) 209-213
139. Yao A.C. Protocols for secure communication. Proceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science (1982) 160-164
140. Yao A.C. How to generate and exchange secrets. Proceedings of the 27th IEEE Symposium on the Foundations of Computer Science (1986) 162-167
141. Zlotkin G., and Rosenschein J.S. Incomplete information and deception in multiagent negotiation. Proceedings of the Twelfth International Joint Conference on Artificial Intelligence. Sydney, Australia (1991) 225-231
142. Zuckerman D. Simulating BPP using general weak random source. Proceedings of the 32nd IEEE Symposium on the Foundations of Computer Science (1991) 79-89