N. Megiddo, "On Computable Beliefs of Rational Machines," Games and Economic Behavior 1, pp. 144-169, 1989.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....of improvements in the outcome. We are particularly interested in the computational resources required for questions related to a solution. There have been more and more studies on the computational aspects of game theory problems, though early works may even be traced back to two decades ago [29, 20, 33, 36, 24, 31, 37, 6, 28, 38, 14, 32, 27]. An extensive discussion can be found in a review by Kalai on interplays of operations research, game theories, and theoretical computer science [23] There is another important observation that applying computational issues to game theory problems will be fruitful and enlightening. Like many ....

N. Megiddo, "On Computable Beliefs of Rational Machines," Games and Economic Behavior 1, pp. 144-169, 1989.

....of interactive proofs and zero knowledge proofs [GMR89] can be viewed as precursors of this work. Although our model is significantly different, it is in the spirit of [Mos88, HMT88] There have also been many attempts in the game theoretical literature to model resource bounded agents, e.g. [Meg89, MW86, Ney85, Rub85] (see [Bin90] Chapters 5 6) for a foundational discussion) our formal model is much different from any proposed in this literature. 2 Knowledge in multi agent systems We briefly review the framework of [FHMV95] for modeling multi agent systems. We assume that at each point in time, each agent ....

N. Megiddo. On computable beliefs of rational machines. Games and Economical Behavior, 1:144--169, 1989.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC