Possibilistic Boolean games: strategic reasoning under incomplete information

Boolean games offer a compact alternative to normal-form games, by encoding the goal of each agent as a propositional formula. In this paper, we show how this framework can be naturally extended to model situations in which agents are uncertain about other agents' goals. We first use uncertainty measures from possibility theory to semantically define (solution concepts to) Boolean games with incomplete information. Then we present a syntactic characterization of these semantics, which can readily be implemented, and we characterize the computational complexity

On Byzantine Broadcast in Loosely Connected Networks

We consider the problem of reliably broadcasting information in a multihop asynchronous network that is subject to Byzantine failures. Most existing approaches give conditions for perfect reliable broadcast (all correct nodes deliver the authentic message and nothing else), but they require a highly connected network. An approach giving only probabilistic guarantees (correct nodes deliver the authentic message with high probability) was recently proposed for loosely connected networks, such as grids and tori. Yet, the proposed solution requires a specific initialization (that includes global knowledge) of each node, which may be difficult or impossible to guarantee in self-organizing networks - for instance, a wireless sensor network, especially if they are prone to Byzantine failures. In this paper, we propose a new protocol offering guarantees for loosely connected networks that does not require such global knowledge dependent initialization. In more details, we give a methodology to determine whether a set of nodes will always deliver the authentic message, in any execution. Then, we give conditions for perfect reliable broadcast in a torus network. Finally, we provide experimental evaluation for our solution, and determine the number of randomly distributed Byzantine failures than can be tolerated, for a given correct broadcast probability.Comment: 1

A Scalable Byzantine Grid

Modern networks assemble an ever growing number of nodes. However, it remains difficult to increase the number of channels per node, thus the maximal degree of the network may be bounded. This is typically the case in grid topology networks, where each node has at most four neighbors. In this paper, we address the following issue: if each node is likely to fail in an unpredictable manner, how can we preserve some global reliability guarantees when the number of nodes keeps increasing unboundedly ? To be more specific, we consider the problem or reliably broadcasting information on an asynchronous grid in the presence of Byzantine failures -- that is, some nodes may have an arbitrary and potentially malicious behavior. Our requirement is that a constant fraction of correct nodes remain able to achieve reliable communication. Existing solutions can only tolerate a fixed number of Byzantine failures if they adopt a worst-case placement scheme. Besides, if we assume a constant Byzantine ratio (each node has the same probability to be Byzantine), the probability to have a fatal placement approaches 1 when the number of nodes increases, and reliability guarantees collapse. In this paper, we propose the first broadcast protocol that overcomes these difficulties. First, the number of Byzantine failures that can be tolerated (if they adopt the worst-case placement) now increases with the number of nodes. Second, we are able to tolerate a constant Byzantine ratio, however large the grid may be. In other words, the grid becomes scalable. This result has important security applications in ultra-large networks, where each node has a given probability to misbehave.Comment: 17 page

Linear Connections in Non-Commutative Geometry

A construction is proposed for linear connections on non-commutative algebras. The construction relies on a generalisation of the Leibnitz rules of commutative geometry and uses the bimodule structure of $\Omega^1$. A special role is played by the extension to the framework of non-commutative geometry of the permutation of two copies of $\Omega^1$. The construction of the linear connection as well as the definition of torsion and curvature is first proposed in the setting of the derivations based differential calculus of Dubois- Violette and then a generalisation to the framework proposed by Connes as well as other non-commutative differential calculi is suggested. The covariant derivative obtained admits an extension to the tensor product of several copies of $\Omega^1$. These constructions are illustrated with the example of the algebra of $n \times n$ matrices.Comment: 15 pages, LMPM ../94 (uses phyzzx

Aids given to beginning teachers in Rhode Island: their source and their usefulness.

Thesis (Ed.M.)--Boston Universit

Tuning the electronic transport properties of graphene through functionalisation with fluorine

Engineering the electronic properties of graphene has triggered great interest for potential applications in electronics and opto-electronics. Here we demonstrate the possibility to tune the electronic transport properties of graphene monolayers and multilayers by functionalisation with fluorine. We show that by adjusting the fluorine content different electronic transport regimes can be accessed. For monolayer samples, with increasing the fluorine content, we observe a transition from electronic transport through Mott variable range hopping in two dimensions to Efros - Shklovskii variable range hopping. Multilayer fluorinated graphene with high concentration of fluorine show two-dimensional Mott variable range hopping transport, whereas CF0.28 multilayer flakes have a band gap of 0.25eV and exhibit thermally activated transport. Our experimental findings demonstrate that the ability to control the degree of functionalisation of graphene is instrumental to engineer different electronic properties in graphene materials.Comment: 6 pages, 5 figure

Linear Connections on Fuzzy Manifolds

Linear connections are introduced on a series of noncommutative geometries which have commutative limits. Quasicommutative corrections are calculated.Comment: 10 pages PlainTex; LPTHE Orsay 95/42; ESI Vienna 23

Efficacy of Morphological Characters for Distinguishing Nymphs of \u3ci\u3eEpitheca Cynosura\u3c/i\u3e and \u3ci\u3eEpitheca Spinigera\u3c/i\u3e (Odonata: Corduliidae) in Wisconsin

Attempts to distinguish exuviae and last-instar nymphs of Epitheca cynosura (Say) and Epitheca spinigera (Selys) (Odonata: Corduliidae) using lateral spine characters have proven to be unreliable, and recent use of setae counts on only one side of the prementum or one labial palp have led to confusion because these structures often hold unequal numbers of setae on the two sides of the same specimen. Based on exuviae of 67 reared E. cynosura and 55 reared E. spinigera from lakes throughout Wisconsin, we tested the efficacy of previously used character states for distinguishing these species and searched for new characters to improve the reliability of regional keys. The most reliable diagnostic character was the combined number of setae on both sides of the prementum and on both labial palps (≤ 35 – E. cynosura; ≥ 36 – E. spinigera), which correctly determined 96% of our specimens. For the small percentage of specimens that lie in the region of overlap in total setae number, we found that total exuviae length, cerci ÷ epiproct ratios of females, tubercle distance ÷ epiproct ratios of males, and the shape of the dorsal hook on segment 8 could be used to strengthen determinations