In many economic situations, a player pursues coordination or anti-coordination with her neighbors on a network, but she also has intrinsic preferences among the available options. We here introduce a model which allows to analyze this issue by means of a simple framework in which players endowed with an idiosyncratic identity interact on a social network through strategic complements or substi...

We extend here the work on interleaved distributed graph based backjumping, IDIBT/GBJ 7,6,5 by considering conflicting agents . The resulting method IDIBT/CBJ-DkC for Conflict-directed BackJumbing and Directed k-Consistency combines distributed and parallel explorations of search spaces with more efficient backtrack steps. We take advantage of the asynchronous framework to implement a more refi...

Multicore main-memory databases only obtain parallel performance when transactions do not conflict. Conflicting transactions are executed one at a time in order to ensure that they have serializable effects. Sequential execution on contended data leaves cores idle and reduces throughput. In other parallel programming contexts—not serializable transactions— techniques have been developed that ca...

We shall say that C is a set of conflicting literals if and only if we do not want every element of C to be provable. Defeasible Logic is generalised to incorporate sets of conflicting literals. The resulting logic is more expressive and yields better solutions to some reasoning puzzles. Some properties of this generalised Defeasible Logic are proved.

We consider the two-fold problem of representing collective beliefs and aggregating these beliefs. We propose modular, transitive relations for collective beliefs. They allow us to represent conflicting opinions and they have a clear semantics. We compare them with the quasi-transitive relations often used in social choice. Then, we describe a way to construct the belief state of an agent infor...