OPTIMAL USE OF COMMUNICATION RESOURCES

We study a repeated game with asymmetric information about a dynamic state of nature. In the course of the game, the better informed player can communicate some or all of his information with the other. Our model covers costly and/or bounded communication. We characterize the set of equilibrium payoffs, and contrast these with the communication equilibrium payoffs, which by definition entail no communication costs.Repeated games, communication, entropy

Communication, decision-making and the optimal degree of transparency of monetary policy committees

This paper develops a theoretical model of dynamic decision-making of a monetary policy committee with heterogeneous members. It investigates the optimal transparency, and the optimal way of transmitting information of committees, by analysing the effects different communication strategies have on financial markets. It is shown that the communication strategy of the central bank committee has a significant effect on the predictability of monetary policy decisions when there is asymmetric information between the committee and market agents. Transparency about the diversity of views of the committee surrounding the economic outlook makes future monetary policy more predictable. However, communicating the diversity of views regarding monetary policy decisions may lead to less predictability of monetary policy in the short term. In addition, it is shown that communication in the form of voting records has the greatest effect on market participants' near term policy expectations. These results support findings of the empirical literature and have strong implications for the optimal communication strategies of committees including the question whether individual voting records should be published. --Monetary Policy Committees,Uncertainty,Communication,Transparency

A TDMA scheduler for the AROS architecture

Abstract In this paper we present a Time Division Multiple Access (TDMA) scheduler for the Asymmetric communication and ROuting in Sensor networks architecture (AROS). The scheduler enables dynamic network configurations of the AROS architecture. We show that asymmetric multihop communication with dynamic network configurations in AROS prolongs the lifetime of sensor nodes in long distance networks compared to the LEACH architecture

Atroposelective Synthesis of PINAP via Dynamic Kinetic Asymmetric Transformation

The atroposelective synthesis of PINAP ligands has been accomplished via a palladium‐catalyzed C−P coupling process through dynamic kinetic asymmetric transformation. These catalytic conditions allow access to a wide variety of alkoxy‐ and benzyloxy‐substituted PINAP ligands in high enantiomeric excess. The methods described in this communication afford valuable P,N ligands in good yields and high enantioselectivity using low catalyst loading

Common Knowledge and Interactive Behaviors: A Survey

This paper surveys the notion of common knowledge taken from game theory and computer science. It studies and illustrates more generally the effects of interactive knowledge in economic and social problems. First of all, common knowledge is shown to be a central concept and often a necessary condition for coordination, equilibrium achievement, agreement, and consensus. We present how common knowledge can be practically generated, for example, by particular advertisements or leadership. Secondly, we prove that common knowledge can be harmful, essentially in various cooperation and negotiation problems, and more generally when there are con icts of interest. Finally, in some asymmetric relationships, common knowledge is shown to be preferable for some players, but not for all. The ambiguous welfare effects of higher-order knowledge on interactive behaviors leads us to analyze the role of decentralized communication in order to deal with dynamic or endogenous information structures.Interactive knowledge, common knowledge, information structure, communication.

An Efficient Distributed Group Key Management Using Hierarchical Approach with ECDH and Symmetric Algorithm

Ensuring secure communication in an ad hoc network is extremely challenging because of the dynamic nature of the network and the lack of centralized management. For this reason, key management is particularly difficult to implement in such networks. Secure group communication is an increasingly popular research area having received much attention in recent years. Group key management is a fundamental building block for secure group communication systems. We will present an efficient many-to-many group key management protocol in distributed group communication. In this protocol, group members are managed in the hierarchical manner logically. Two kinds of keys are used, asymmetric and symmetric keys. The leaf nodes in the key tree are the asymmetric keys of the corresponding group members and all the intermediate node keys are symmetric keys assigned to each intermediate node. For asymmetric key, a more efficient key agreement will be introduced. To calculate intermediate node keys, members use codes assigned to each intermediate node key tree. Group members calculate intermediate node keys rather than distributed by a sponsor member. The features of this approach are that, no keys are exchanged between existing members at join, and only one key, the group key, is delivered to remaining members at leave. Keywords: Elliptic Curve, Distributed Group Key Management, Hierarchical Key Management, Mobile Ad-hoc network (MANET)