On Probabilistic Machines, Bounded Rationality and Average-Case Complexity

Nimrod Megiddo
Additional contact information
Nimrod Megiddo: IBM Almaden Research Center

Chapter Essay 9 in Essays in Game Theory, 1994, pp 123-128 from Springer

Abstract: Abstract The analogs of pure, mixed and behavior strategies in the context of algorithms are studied. It is shown that probabilistic machines are more powerful than probability distributions over deterministic ones, that best response may sometimes requires randomization, and that if nature’s choices are computable then there exists a deterministic best response.

Keywords: Probability Distribution; Turing Machine; Mixed Strategy; Expected Payoff; Bound Rationality (search for similar items in EconPapers)
Date: 1994
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4612-2648-2_9

Ordering information: This item can be ordered from
http://www.springer.com/9781461226482

DOI: 10.1007/978-1-4612-2648-2_9

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().