A decentralized model of information pricing in networks

We propose a recursive method of pricing an information good in a network of holders and demanders of this good. The prices are determined via a unique equilibrium outcome in a sequence of bilateral bargaining games that are played by connected agents. If the information is an homogenous, non-depreciating good without network effects we derive explicit formulae which elucidate the role of the link pattern among the players. Particularly, we find out that the equilibrium price is intimately related to the existence of cycles in the network: It is zero if a cycle covers the trading pair and it is proportional to the direct and indirect utility that the good generates otherwise.

Philosophers and practical men: Charles Babbage, Irish merchants and the economics of information

Before the emergence of coordination of production by firms, manufacturers and merchants traded in markets with asymmetric information. Evidence suggests that the practical knowledge thus gained by these agents was well in advance of contemporary political economists and anticipates twentieth-century developments in the economics of information. Charles Babbage, who regarded merchants and manufacturers as the chief sources of reliable economic data, drew on this knowledge as revealed in the evidence of manufacturers and merchants presented to House of Commons select committees to make an important pioneering contribution to the theory of production and exchange with information asymmetries.

Human information retrieval

Information retrieval in the age of Internet search engines has become part of ordinary discourse and everyday practice: "Google" is a verb in common usage. Thus far, more attention has been given to practical understanding of information retrieval than to a full theoretical account. In Human Information Retrieval, Julian Warner offers a comprehensive overview of information retrieval, synthesizing theories from different disciplines (information and computer science, librarianship and indexing, and information society discourse) and incorporating such disparate systems as WorldCat and Google into a single, robust theoretical framework. There is a need for such a theoretical treatment, he argues, one that reveals the structure and underlying patterns of this complex field while remaining congruent with everyday practice. Warner presents a labor theoretic approach to information retrieval, building on his previously formulated distinction between semantic and syntactic mental labor, arguing that the description and search labor of information retrieval can be understood as both semantic and syntactic in character. Warner's information science approach is rooted in the humanities and the social sciences but informed by an understanding of information technology and information theory. The chapters offer a progressive exposition of the topic, with illustrative examples to explain the concepts presented. Neither narrowly practical nor largely speculative, Human Information Retrieval meets the contemporary need for a broader treatment of information and information systems.

Imperfect assessment and limited information preclude optimal strategies in male-male fights in the orb-weaving spider Metellina mengei

Agonistic behaviour between male orb-web spiders Metellina mengei competing for access to female webs was examined in field experiments to test the major predictions of game theory. Winners of fights were significantly larger than losers, particularly with respect to the length of the first pair of legs, which are sexually dimorphic in this species and used extensively in agonistic encounters. The size of the winning male had no influence on contest intensity or duration, and neither did relative size. However, fight intensity and duration were both positively correlated with the size of the losing male. Resident males won significantly more contests than intruders. Winning intruders were significantly larger than winning residents and it was these winning intruders that tended to produce the longer fights. Female weight and hence reproductive value had a marked influence on fight intensity and duration of fights won by the intruder but not those won by the resident. This indicates that only the resident obtains information about the female. These data are discussed with reference to the discrepancy with theory and a failure of some contestants to obtain information on resource value and relative contestant size necessary to optimize fight strategy.

Information gathering and decision making about resource value in animal contests

Contestants are predicted to adjust the cost of a fight in line with the perceived value of the resource and this provides a way of determining whether the resource has been assessed. An assessment of resource value is predicted to alter an animal's motivational state and we note different methods of measuring that state. We provide a categorical framework in which the degree of resource assessment may be evaluated and also note limitations of various approaches. We place studies in six categories: (1) cases of no assessment, (2) cases of internal state such as hunger influencing apparent value, (3) cases of the contestants differing in assessment ability, (4) cases of mutual and equal assessment of value, (5) cases where opponents differ in resource value and (6) cases of particularly complex assessment abilities that involve a comparison of the value of two resources. We examine the extent to which these studies support game theory predictions and suggest future areas of research. (C) 2008 The Association for the Study of Animal Behaviour. Published by Elsevier Ltd. All rights reserved.

Information theoretic measures of UHG graphs with low computational complexity

We introduce a novel graph class we call universal hierarchical graphs (UHG) whose topology can be found numerously in problems representing, e.g., temporal, spacial or general process structures of systems. For this graph class we show, that we can naturally assign two probability distributions, for nodes and for edges, which lead us directly to the definition of the entropy and joint entropy and, hence, mutual information establishing an information theory for this graph class. Furthermore, we provide some results under which conditions these constraint probability distributions maximize the corresponding entropy. Also, we demonstrate that these entropic measures can be computed efficiently which is a prerequisite for every large scale practical application and show some numerical examples. (c) 2007 Elsevier Inc. All rights reserved.

Bridging Jeffrey's Rule, AGM Revision and Dempster Conditioning in the Theory of Evidence

Belief revision characterizes the process of revising an agent’s beliefs when receiving new evidence. In the field of artificial intelligence, revision strategies have been extensively studied in the context of logic-based formalisms and probability kinematics. However, so far there is not much literature on this topic in evidence theory. In contrast, combination rules proposed so far in the theory of evidence, especially Dempster rule, are symmetric. They rely on a basic assumption, that is, pieces of evidence being combined are considered to be on a par, i.e. play the same role. When one source of evidence is less reliable than another, it is possible to discount it and then a symmetric combination operation
is still used. In the case of revision, the idea is to let prior knowledge of an agent be altered by some input information. The change problem is thus intrinsically asymmetric. Assuming the input information is reliable, it should be retained whilst the prior information should be changed minimally to that effect. To deal with this issue, this paper defines the notion of revision for the theory of evidence in such a way as to bring together probabilistic and logical views. Several revision rules previously proposed are reviewed and we advocate one of them as better corresponding to the idea of revision. It is extended to cope with inconsistency between prior and input information. It reduces to Dempster
rule of combination, just like revision in the sense of Alchourron, Gardenfors, and Makinson (AGM) reduces to expansion, when the input is strongly consistent with the prior belief function. Properties of this revision rule are also investigated and it is shown to generalize Jeffrey’s rule of updating, Dempster rule of conditioning and a form of AGM revision.

Ultra-fast spin dynamics in the 2s2p^2 configuration of C^+ studied by time-dependent R-matrix theory

We employ time-dependent R-matrix theory to study ultra-fast dynamics in the doublet 2s2p(2) configuration of C+ for a total magnetic quantum number M = 1. In contrast to the dynamics observed for M = 0, ultra-fast dynamics for M = 1 is governed by spin dynamics in which the 2s electron acts as a flag rather than a spectator electron. Under the assumption that m(S) = 1/2, m(2s) = 1/2 allows spin dynamics involving the two 2p electrons, whereas m(2s) = -1/2 prevents spin dynamics of the two 2p electrons. For a pump-probe pulse scheme with (h) over bar omega(pump) = 10.9 eV and (h) over bar omega(probe) = 16.3 eV and both pulses six cycles long, little sign of spin dynamics is observed in the total ionization probability. Signs of spin dynamics can be observed, however, in the ejected-electron momentum distributions. We demonstrate that the ejected-electron momentum distributions can be used for unaligned targets to separate the contributions of initial M = 0 and M = 1 levels. This would, in principle, allow unaligned target ions to be used to obtain information on the different dynamics in the 2s2p(2) configuration for the M = 0 and M = 1 levels from a single experime

Theory of pixel lensing toward M31. II. The velocity anisotropy and flattening of the MACHO distribution

The POINT-AGAPE collaboration is currently searching for massive compact halo objects (MACHOs) toward the Andromeda galaxy (M31). The survey aims to exploit the high inclination of the M31 disk, which causes an asymmetry in the spatial distribution of M31 MACHOs. Here, we investigate the effects of halo velocity anisotropy and flattening on the asymmetry signal using simple halo models. For a spherically symmetric and isotropic halo, we find that the underlying pixel lensing rate in far-disk M31 MACHOs is more than 5 times the rate of near-disk events. We find that the asymmetry is further increased by about 30% if the MACHOs occupy radial orbits rather than tangential orbits, but it is substantially reduced if the MACHOs lie in a flattened halo. However, even for halos with a minor- to major-axis ratio of q = 0.3, the number of M31 MACHOs in the far side outnumber those in the near side by a factor of similar to2. There is also a distance asymmetry, in that the events on the far side are typically farther from the major axis. We show that, if this positional information is exploited in addition to number counts, then the number of candidate events required to confirm asymmetry for a range of flattened and anisotropic halo models is achievable, even with significant contamination by variable stars and foreground microlensing events. For pixel lensing surveys that probe a representative portion of the M31 disk, a sample of around 50 candidates is likely to be sufficient to detect asymmetry within spherical halos, even if half the sample is contaminated, or to detect asymmetry in halos as flat as q = 0.3, provided less than a third of the sample comprises contaminants. We also argue that, provided its mass-to-light ratio is less than 100, the recently observed stellar stream around M31 is not problematic for the detection of asymmetry.

Possibilistic Information Fusion Using Maximal Coherent Subsets

When multiple sources provide information about the same unknown quantity, their fusion into a synthetic interpretable message is often a tedious problem, especially when sources are conicting. In this paper, we propose to use possibility theory and the notion of maximal coherent subsets, often used in logic-based representations, to build a fuzzy belief structure that will be instrumental both for extracting useful information about various features of the information conveyed by the sources and for compressing this information into a unique possibility distribution. Extensions and properties of the basic fusion rule are also studied.

How position, velocity, and temporal information combine in the prospective control of catching:data and model

The cerebral cortex contains circuitry for continuously computing properties of the environment and one's body, as well as relations among those properties. The success of complex perceptuomotor performances requires integrated, simultaneous use of such relational information. Ball catching is a good example as it involves reaching and grasping of visually pursued objects that move relative to the catcher. Although integrated neural control of catching has received sparse attention in the neuroscience literature, behavioral observations have led to the identification of control principles that may be embodied in the involved neural circuits. Here, we report a catching experiment that refines those principles via a novel manipulation. Visual field motion was used to perturb velocity information about balls traveling on various trajectories relative to a seated catcher, with various initial hand positions. The experiment produced evidence for a continuous, prospective catching strategy, in which hand movements are planned based on gaze-centered ball velocity and ball position information. Such a strategy was implemented in a new neural model, which suggests how position, velocity, and temporal information streams combine to shape catching movements. The model accurately reproduces the main and interaction effects found in the behavioral experiment and provides an interpretation of recently observed target motion-related activity in the motor cortex during interceptive reaching by monkeys. It functionally interprets a broad range of neurobiological and behavioral data, and thus contributes to a unified theory of the neural control of reaching to stationary and moving targets.