N. Linial, Games computers play: Game-theoretic aspects of computing, Technical Report 92-5, Leibniz Center for Computer Science, Hebrew University, Jerusalem, 1992. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Coalition Structure Generation with Worst Case Guarantees - Sandholm, Larson.. (1999) (30 citations) (Correct)
....could repeatedly search more and more as time allows, again using the distributed method. 8 The randomization can be done without a trusted third party by using a recent distributed nonmanipulable protocol for randomly permuting the agents [51] Distributed randomization is also discussed in [24]. 9 In short, agents strategies are said to be in Nash equilibrium if each agent s strategy is a best response to the strategies of the others [26,27] 10 Agent j will try to trade off the cost of search against the risk of getting caught, and could decide that the risk is worth taking. ....
N. Linial, Games computers play: Game-theoretic aspects of computing, Technical Report 92-5, Leibniz Center for Computer Science, Hebrew University, Jerusalem, 1992.
Distributed Games: From Mechanisms to Protocols - Monderer, Tennenholtz (1999) (16 citations) (Correct)
....this claim is basically correct, researchers have noticed that in order to design protocols for non cooperative computational environments, various modifications to the mechanism design theory are needed. In particular, researchers have been concerned with the fact agents are resource bounded [10, 18, 8]. However, except for the important issue of bounded resources there are several other issues that may make a difference when one tries to adapt the game theoretical approach to mechanism design in computational settings. These issues arise from the fact that the players in such a mechanism are ....
Nathan Linial. Games Computers Play: Game-Theoretic Aspects of Computing. Technical Report 92--5, CS Department, Hebrew University, Israel, 1992.
Coalition Structure Generation with Worst Case Guarantees - Sandholm, Larson.. (1999) (30 citations) (Correct)
....that j searches all of the nodes in its space could be made close to one. The probability 5 The randomization can be done without a trusted third party by using a recent distributed nonmanipulable protocol for randomly permuting the agents [51] Distributed randomization is also discussed in [24]. 6 In short, agents strategies are said to be in Nash equilibrium if each agent s strategy is a best response to the strategies of the others [27, 26] that i searches would go close to zero, which minimizes enforcement overhead. 7 5. Additional search: The previous steps of this ....
N. Linial. Games computers play: Game-theoretic aspects of computing. Technical Report 92-5, Leibniz Center for Computer Science, Hebrew University, Jerusalem, 1992.
Anytime Coalition Structure Generation with Worst.. - Sandholm, Larson.. (1998) (9 citations) (Correct)
....search more and more as time allows, again using the distributed method. 9 The randomization can be done without a trusted third party by using a distributed nonmanipulable protocol for randomly permuting agents (Zlotkin Rosenschein 1994) Distributed randomization is also discussed in (Linial 1992). 10 See (Mas Colell, Whinston, Green 1995) for a definition of Nash equilibrium. 11 Agent j will try to trade off the cost of search against the risk of getting caught, and could decide that the risk is worth taking. This problem can be minimized by choosing a high enough P . 6. Payoff ....
Linial, N. 1992. Games computers play: Game-theoretic aspects of computing. Technical Report 92-5, Leibniz Center for Computer Science, Hebrew University, Jerusalem.
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