Y. Moses, D. Dolev, and J.Y. Halpern. Cheating husbands and other stories: a case study of knowledge, action and communication. Distributed Computing, 1(3):167--176, 1986.  Home/Search   Document Not in Database   Summary   ACM   TOC   Related Articles   Check

.... problem which game theorists may find natural is: How to establish common knowledge in the absence of a mechanism which can guarantee reliable information passing In known examples, where a problem is solved by turning some fact into common knowledge, e.g. the betraying wives puzzle (see [MDH] for an amusing discussion of a number of such examples) there is an instance where all parties involved are situated in one location, the pertinent fact is being announced, thus becoming common knowledge. If information passes only through private communication lines, and moreover some ....

Y. Moses, D. Dolev and J. Y. Halpern, Cheating husbands and other stories: a case study of knowledge, action, and communication, Distributed Computing 1(1986) 167 - 176.

....run R at time t and the run R 0 at time t 0 are indistinguishable to p. Finally, R; t) j= K p (OE) 8(R 0 ; t 0 ) p (R; t) R 0 ; t 0 ) j= OE] For a detailed treatment of Knowledge Theory as applied to distributed systems, the reader should refer to the seminal work done in [MDH86,HM90] Recall that in Section 3.1.2 we defined a failure detector to be a function that maps each failure pattern to a set of failure detector histories. Thus, the specification of a failure detector depends solely on the failure pattern actually encountered. In contrast, the definition of ....

Yoram Moses, Danny Dolev, and Joseph Y. Halpern. Cheating husbands and other stories: a case study of knowledge, action, and communication. Distributed Computing, 1(3):167--176, 1986. 120

....communication is by synchronous broadcast. Examples of this are systems in which agents communicate by means of a shared bus, by writing tokens onto a shared blackboard [Nii 1986] and in face to face conversation. Other examples are classical puzzles such as the wise men, or muddy children puzzle [Moses et al. 1986], and a variety of games of incomplete information, including Battleships, Stratego, and Bridge. Broadcast environments have been considered previously in van der Meyden [1996b] To de ne broadcast environments, we need to impose a number of constraints on the components making up the de nition ....

Moses, Y., Dolev, D., and Halpern, J. 1986. Cheating husbands and other stories: A case study of knowledge, action, and communication. Distributed Computing 1, 3, 167-176.

....communication is by synchronous broadcast. Examples of this are systems in which agents communicate by means of a shared bus, by writing tokens onto a shared blackboard [Nii 1986] and in face to face conversation. Other examples are classical puzzles such as the wise men, or muddy children puzzle [Moses et al. 1986], and a variety of games of incomplete information, including battleships, Stratego and Bridge. Broadcast environments have been considered previously in [Meyden 1996b] To de ne broadcast environments, we need to impose a number of constraints on the components making up the de nition of ....

Moses, Y., Dolev, D., and Halpern, J. 1986. Cheating husbands and other stories: A case study of knowledge, action, and communication. Distributed Computing 1, 3, 167-176.

....all communication is by synchronous broadcast. Examples of this are systems in which agents communicate by means of a shared bus, by writing tokens onto a shared blackboard [Nii86] and in face to face conversation. Other examples are classical puzzles such as the wise men, or muddy children puzzle [MDH86], and a variety of games of incomplete information, including battleships, Stratego and Bridge. Broadcast environments have been considered previously in [Mey96a] To define broadcast environments, we need to impose a number of constraints on the components making up the definition of ....

Y. Moses, D. Dolev, and J. Halpern. Cheating husbands and other stories: A case study of knowledge, action, and communication. Distributed Computing, 1(3):167--176, 1986.

....PROSIT has been effectively exploited is the Three Wisemen Problem [32] This is a problem involving common knowledge (mutual information) in a multi agent setting. Pinning our faith upon situation theory, we tried to make use of PROSIT in the solution of what we came to call epistemic puzzles [19, 26, 30, 38, 39, 40, 41, 42]. Throughout this paper the nature of epistemic puzzles and their solution via a situation theoretic world view will be analyzed. A short introduction to situation theory and situation semantics, and two other computational systems (ASTL and BABY SIT) will be offered in the next two chapters, ....

....[19] and has long been the primary example to illustrate the subtle relationship between knowledge, communication, and action in a distributed environment [16] The puzzle involves an initial step in which a set of facts is announced publicly, thereby becoming common knowledge. Moses et al. [30], using a number of variants of the puzzle, try to describe what happens when 1. synchronous communication, 2. asynchronous communication, and 3. ring based communication channels are used to communicate the protocol to be followed, i.e. announce the orders of the queen. The distributed ....

Y. Moses, D. Dolev, and J. Y. Halpern. Cheating husbands and other stories: A case study of knowledge, action, and communication. Distributed Computing, 1:167--176, 1986.

.... us see where and why we should utilize systems based on situation theory, and how we should go about formulating a situation oriented programming paradigm [23, 22] Pinning our faith upon situation theory, we tried to make use of PROSIT in the solution of what we came to call epistemic puzzles [13, 19, 20]. Thus, throughout this paper the nature of epistemic puzzles and their modeling via a situation theoretic world view will be analyzed. A short introduction to situation theory will be offered in the next section. This will be followed by a review of PROSIT. Then we ll explain what epistemic ....

....from folklore and has long been the primary example to illustrate the subtle relationship between knowledge, communication, and action in a distributed environment. The puzzle involves an initial step in which a set of facts is announced publicly, thereby becoming common knowledge. Moses et al. [13], using a number of variants of the puzzle, describe what happens when synchronous, asynchronous, and ring based communication channels are used to send a protocol to be followed, e.g. announce the orders of the queen. The area of distributed computing is mainly interested in the types of ....

Yoram Moses, Danny Dolev, and Joseph Y. Halpern. Cheating husbands and other stories: A case study of knowledge, action, and communication. Distributed Computing, 1:167--176, 1986.

....important in that respect. This (small) digression is based on the premise that not just one, but several approaches are possible to solve problems in distributed computing. Current formalisms promote reasoning about events (Lamport [55, 20] states (Chandy and Misra [21] or knowledge (Halpern [69]) However, we have shown that recent results in social choice theory (Moulin [71, 70] can also prove to be useful, as they provide a better understanding about voting procedures. Similarly, advances in game theory (Conway [26] might also be adequate for distributed applications where decisions ....

Y. Moses, D. Dolev, and J. H. Halpern. Cheating husbands and other stories: A case study of knowledge, action, and communication (preliminary version). In Proceedings of the Fourth Annual ACM Symposium on Principles of Distributed Computing, pages 215--223, August 1985.

....important in that respect. This (small) digression is based on the premise that not just one, but several approaches are possible to solve problems in distributed computing. Current formalisms promote reasoning about events (Lamport [56, 21] states (Chandy and Misra [22] or knowledge (Halpern [70]) However, we have shown that recent results in social choice theory (Moulin [72, 71] can also prove to be useful, as they provide a better understanding about voting procedures. Similarly, advances in game theory (Conway [27] might also be adequate for distributed applications where decisions ....

Y. Moses, D. Dolev, and J. H. Halpern. Cheating husbands and other stories: A case study of knowledge, action, and communication (preliminary version). In Proceedings of the Fourth Annual ACM Symposium on Principles of Distributed Computing, pages 215--223, August 1985.

....to maximal satisfaction) does not. Monotonicity is certainly a desirable property for a monotonic specification and program, once we prove that the specification holds for the program for a given initial 5 Another example of the phenomenon that extra knowledge can be harmful can be found in [20]. This is also a well known phenomenon in the economics game theory literature [23] 11 condition, then we can immediately conclude that it holds for all stronger specifications. Without monotonicity, one may have to reprove the property for all stronger initial conditions. Maximal satisfaction ....

Y. Moses, D. Dolev, and J. Y. Halpern. Cheating husbands and other stories: a case study of knowledge, action, and communication. Distributed Computing, 1(3):167--176, 1986.

....verifier learns that with high probability, the prover can generate an isomorphism between the graphs in question. Similarly, in the case of three colorability, the verifier learns that with high probability the prover can generate a three coloring of the graph in question. It is well known (see [HM84, MDH86]) that information about the prover s knowledge can dramatically affect the verifier s knowledge about the world. For example, in the case of three colorability, information about the prover s knowledge may indicate to the verifier that the prover has with high probability communicated with the ....

Y. Moses, D. Dolev, and J. Y. Halpern, Cheating husbands and other stories: a case study of knowledge, action, and communication, Distributed Computing 1:3, 1986, pp. 167--176.

....we consider the interaction between knowledge and action. Intuitively, a process actions depend on its knowledge, and its knowledge changes as a result of actions. The precise interaction between knowledge and action can be subtle, as is demonstrated by the analyses performed in such papers as [CM86, DM90, HM90, Leh84, MDH86, MT88]. Our aim is to understand and clarify these subtleties. We start by providing a formal model of distributed systems. There are a number of ways that one can model a system of interacting processes or agents; it is doubtful that there is a best model. Whereas one approach might lend itself ....

....the relationship between knowledge and action, and thus provide a convenient high level description of what a process should do in certain situations. We discuss knowledge based protocols in detail in Section 5. 1 In Section 6, we consider the cheating husbands problem, informally discussed in [MDH86], and show how it can be captured in our framework. This example also shows how the same knowledge based protocol corresponds to distinct standard protocols in different systems. In Section 7 we discuss what it means for one protocol to implement another in our context. We conclude in Section 8 by ....

[Article contains additional citation context not shown here]

Y. Moses, D. Dolev, and J. Y. Halpern. Cheating husbands and other stories: a case study of knowledge, action, and communication. Distributed Computing, 1(3):167--176, 1986.

....reader to check that when there are k muddy children, E k m suffices to ensure that the muddy children will be able to prove their dirtiness, whereas E k Gamma1 m does not. For a more detailed analysis of this argument, and for a general treatment of variants of the muddy children puzzle, see [MDH86]. Thus, the role of the father s statement was to improve the children s state of knowledge of m from E k Gamma1 m to E k m. In fact, the children have common knowledge of m after the father announces that m holds. Roughly speaking, the father s public announcement of m to the children as a ....

....specifying and verifying protocols, and may also be readily applicable to the synthesis of protocols and plans. Temporal logic has already proved somewhat successful in this regard [EC82, MW84] Our analysis of the muddy children puzzle and the coordinated attack problem, as well as the work in [MDH86, HF85, DM90, MT88] illustrate how subtle the relationship between knowledge, action, and communication in a distributed system can be. In this context, Halpern and Fagin (cf. HF85] look at knowledge based protocols, which are protocols in which a processor s actions are explicitly based on the processor s ....

[Article contains additional citation context not shown here]

Y. Moses, D. Dolev, and J. Y. Halpern. Cheating husbands and other stories: a case study of knowledge, action, and communication. Distributed Computing, 1(3):167--176, 1986.

....we consider knowledge based programs and specifications. Of course, whether something is problematic is, in great measure, in the eye of the beholder. Nevertheless, I would claim that, in the case of maximal 5 Another example of the phenomenon that extra knowledge can be harmful can be found in [MDH86]. This is also a well known phenomenon in the economics game theory literature [Ney91] satisfaction, the only properties that are lost when the initial condition is strengthened are either unimportant properties, or properties that, roughly speaking, ought to be lost. More precisely, they are ....

Y. Moses, D. Dolev, and J. Y. Halpern. Cheating husbands and other stories: a case study of knowledge, action, and communication. Distributed Computing, 1(3):167--176, 1986.

No context found.

Y. Moses, D. Dolev, and J.Y. Halpern. Cheating husbands and other stories: a case study of knowledge, action and communication. Distributed Computing, 1(3):167--176, 1986.

No context found.

Moses, Y. O., D. Dolev, and J. Y. Halpern: 1986, `Cheating husbands and other stories: a case study in knowledge, action, and communication'. Distributed computing 1(3), 167--176.

No context found.

Moses, Y., Dolev D., and Halpern, J.Y. Cheating Husbands and Other Stories: A Case Study of Knowledge, Action, and Communication. Proceedings of the Fourth Annual ACM Symposium on Principles of Distributed Computing, 1985, pp 215-223.

No context found.

Y. Moses, D. Dolev, and J.Y. Halpern. Cheating husbands and other stories: a case study of knowledge, action and communication. Distributed Computing, 1(3):167--176, 1986.

No context found.

Yoram Moses, Danny Dolev, and Joseph Y. Halpern. Cheating husbands and other stories: a case study of knowledge, action, and communication. Distributed Computing, 1(3):167--176, 1986.

No context found.

Yoram Moses, Danny Dolev, and Joseph Y. Halpern. Cheating husbands and other stories: A case study of knowledge, action, and communication. Distributed Computing, 1:167--176, 1986.

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