Non-cooperative computation: Boolean functions with correctness and exclusivity

Theoretical Computer Science

Volumn 343, Issue 1-2, 2005, Pages 97-113

  Shoham, Yoav ^a   Tennenholtz, Moshe ^b  

^a Stanford University   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Cryptography; Informational mechanism design; Non cooperative computation

Indexed keywords

BOOLEAN FUNCTIONS; CRYPTOGRAPHY; FUNCTION EVALUATION; GAME THEORY; PROBABILITY;

INFORMATION MECHANISM DESIGN; NON-COOPERATIVE FUNCTIONS;

COMPUTATION THEORY;

EID: 25444462746     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.05.009     Document Type: Article

References (9)

1. K.J. Arrow Social Choice and Individual Values second ed. 1963 Yale University Press New Haven, CI (1st Ed. published 1951)
2. O. Goldreich Secure multi-party computation 1998 Working draft Weizmann Institute
3. J. Kahn, G. Kalai, N. Linial, The influence of variables on Boolean functions, in: Proc. 29th IEEE Symp. on Foundations of Computer Science, 1985, pp. 68-80.
4. N. Linial Game-theoretic aspects of computer science R.J. Aumann S. Hart Handbook of Game Theory with Economic Applications Vol. II 1994 North-Holland Amsterdam 1340 1395 (Chapter 38)
5. A. Mas-Colell, M.D. Whinston, and J.R. Green Microeconomic Theory 1995 Oxford University Press Oxford
6. R. McGrew, R.W. Porter, and Y. Shoham Towards a general theory of non-cooperative computing Proc. Ninth Conf. on Theoretical Aspects of Rationality and Knowledge (TARK) 2003
7. S. Morris, and H.S. Shin Approximate common knowledge and co-ordination: recent lessons from game theory J. Logic, Language Inform. 6 1997 171 190
8. H. Moulin Social choice R.J. Aumann S. Hart Handbook of Game Theory with Economic Applications Vol. II 1994 North-Holland Amsterdam 1091 1125 (Chapter 31)
9. P. Reny Arrow's theorem and the Gibbard-Satterthwaite theorem: a united approach Econom. Lett. 70 2001 99 105