Intersection Information based on Common Randomness

The introduction of the partial information decomposition generated a flurry of proposals for defining an intersection information that quantifies how much of "the same information" two or more random variables specify about a target random variable. As of yet, none is wholly satisfactory. A palatable measure of intersection information would provide a principled way to quantify slippery concepts, such as synergy. Here, we introduce an intersection information measure based on the G\'acs-K\"orner common random variable that is the first to satisfy the coveted target monotonicity property. Our measure is imperfect, too, and we suggest directions for improvement.Comment: 19 pages, 5 figure

Sequential bargaining with pure common values and incomplete information on both sides

We study the alternating-offer bargaining problem of sharing a common value pie under incomplete information on both sides and no depreciation between two identical players. We characterise the essentially unique perfect Bayesian equilibrium of this game which turns out to be in gradually increasing offers

Car-to-Cloud Communication Traffic Analysis Based on the Common Vehicle Information Model

Although connectivity services have been introduced already today in many of the most recent car models, the potential of vehicles serving as highly mobile sensor platform in the Internet of Things (IoT) has not been sufficiently exploited yet. The European AutoMat project has therefore defined an open Common Vehicle Information Model (CVIM) in combination with a cross-industry, cloud-based big data marketplace. Thereby, vehicle sensor data can be leveraged for the design of entirely new services even beyond traffic-related applications (such as localized weather forecasts). This paper focuses on the prediction of the achievable data rate making use of an analytical model based on empirical measurements. For an in-depth analysis, the CVIM has been integrated in a vehicle traffic simulator to produce CVIM-complaint data streams as a result of the individual behavior of each vehicle (speed, brake activity, steering activity, etc.). In a next step, a simulation of vehicle traffic in a realistically modeled, large-area street network has been used in combination with a cellular Long Term Evolution (LTE) network to determine the cumulated amount of data produced within each network cell. As a result, a new car-to-cloud communication traffic model has been derived, which quantifies the data rate of aggregated car-to-cloud data producible by vehicles depending on the current traffic situations (free flow and traffic jam). The results provide a reference for network planning and resource scheduling for car-to-cloud type services in the context of smart cities

Sequential bargaining with pure common values and incomplete information on both sides

We study the alternating-offer bargaining problem of sharing a common value pie under incomplete information on both sides and no depreciation between two identical players. We characterise the essentially unique perfect Bayesian equilibrium of this game which turns out to be in gradually increasing offers.Gradual bargaining; Common values; Incomplete information; Repeated games

Assisted Common Information: Further Results

We presented assisted common information as a generalization of G\'acs-K\"orner (GK) common information at ISIT 2010. The motivation for our formulation was to improve upperbounds on the efficiency of protocols for secure two-party sampling (which is a form of secure multi-party computation). Our upperbound was based on a monotonicity property of a rate-region (called the assisted residual information region) associated with the assisted common information formulation. In this note we present further results. We explore the connection of assisted common information with the Gray-Wyner system. We show that the assisted residual information region and the Gray-Wyner region are connected by a simple relationship: the assisted residual information region is the increasing hull of the Gray-Wyner region under an affine map. Several known relationships between GK common information and Gray-Wyner system fall out as consequences of this. Quantities which arise in other source coding contexts acquire new interpretations. In previous work we showed that assisted common information can be used to derive upperbounds on the rate at which a pair of parties can {\em securely sample} correlated random variables, given correlated random variables from another distribution. Here we present an example where the bound derived using assisted common information is much better than previously known bounds, and in fact is tight. This example considers correlated random variables defined in terms of standard variants of oblivious transfer, and is interesting on its own as it answers a natural question about these cryptographic primitives.Comment: 8 pages, 3 figures, 1 appendix; to be presented at the IEEE International Symposium on Information Theory, 201

The impact of common APSE interface set specifications on space station information systems

Certain types of software facilities are needed in a Space Station Information Systems Environment; the Common APSE (Ada Program Support Environment) Interface Set (CAIS) was proposed as a means of satisfying them. The reasonableness of this is discussed by examining the current CAIS, considering the changes due to the latest Requirements and Criteria (RAC) document, and postulating the effects on the CAIS 2.0. Finally, a few additional comments are made on the problems inherent in the Ada language itself, especially on its deficiencies when used for implementing large distributed processing and data base applications