scientific article; zbMATH DE number 1226101

MaRDI QIDQ4220403zbMATH OpenFDO

Authors Nathan Linial

Publication date 3 January 1999

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Other game-theoretic models (91A40) Cryptography (94A60)

Cited in

(13)

• Rationality and bounded rationality
• Computational ability in games: individual difference and dynamics
• Learning the state of nature in repeated games with incomplete information and signals
• Game-theoretic analysis of call-by-value computation
• Computer science and decision theory
• Fault tolerant mechanism design
• Computational Aspects of Cooperative Game Theory
• Universal Computation in the Prisoner’s Dilemma Game
• Communication with tokens in repeated games on networks
• scientific article; zbMATH DE number 1882071 (Why is no real title available?)
• Algorithmic mechanism design
• Congestion games with failures
• Communication on networks and strong reliability

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4220403)