Towards a general theory of non-cooperative computation

Proceedings of the 9th Conference on Theoretical Aspects of Rationality and Knowledge, TARK 2003

Volumn , Issue , 2003, Pages 59-71

  McGrew, Robert ^a   Porter, Ryan ^a   Shoham, Yoav ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GAME THEORY;

GAME THEORETIC ANALYSIS; GENERAL THEORY; INCENTIVE COMPATIBLE MECHANISMS; LEXICOGRAPHIC ORDERING; NON-COOPERATIVE; SELF-INTERESTED AGENTS; UTILITY FUNCTIONS;

COMPUTATION THEORY;

EID: 84926119183     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/846241.846249     Document Type: Conference Paper

References (4)

1. M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. STOC'88.
2. Shafi Goldwasser. Multi party computations: past and present. Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing, 1989. ACM.
3. A. Mas-Collel, W. Whinston, and J. Green. Microeconomic Theory. 1995.
4. Yoav Shoham and Moshe Tennenholtz. Non-Cooperative Evaluation of Logical Formulas: The Propositional Case. Under review. 2003.