-
We consider problems where several individuals each need to
make a yes/no choice regarding a number of issues and these
choices then need to be aggregated into a collective choice.
Depending on the application at hand, different combinations
of yes/no may be considered rational. We can describe s...
-
We define the "DEL planning problem" and give a toy example of a
planning algorithm based on DEL.
-
We show how to embed a framework for multilateral negotiation,
in which a group of agents implement a sequence of deals
concerning the exchange of a number of resources, into linear logic.
In this model, multisets of goods, allocations of resources, preferences
of agents, and deals are all modell...
-
We study the problem of fairly dividing a set of goods amongst a group
of agents, when those agents have preferences that are ordinal
relations over alternative bundles of goods (rather than utility
functions) and when our knowledge of those preferences is
incomplete. The incompleteness of the pr...
-
This paper argues for the potential of cognition-based music retrieval
by introducing the notion of a musical ‘hook’ as a key memorization,
recall, and search mechanism.
-
This is a short survey illustrating some of the essential aspects of the
theory of canonical extensions. In addition some topological results about
canonical extensions of lattices with additional operations in finitely
generated varieties are given. In particular, they are doubly algebraic
latti...
-
This paper analyzes the computational complexity of the inductive inference game Eleusis. Eleusis is a card game in which one player constructs a secret rule which has to be discovered by the other players.
We determine the complexity of various decision problems that arise in Eleusis. We show th...
-
We investigate fragments of intuitionistic propositional logic
containing implication but not disjunction. These fragments are
finite, but their size grows superexponentially with the number of
generators. Exact models are used to characterize the fragments.
-
The combination of logic and game theory provides a fine-grained
perspective on information and interaction dynamics, a 'Theory of
Play'. In this paper we lay down the main components of such a theory,
drawing on recent advances in the logical dynamics of actions,
preferences, and information. We...
-
When developing electoral protocols, desiderata include a system which
is transparent, non-manipulable, honest, and not open to
strategizing. However, these desiderata are in tension with each
other: Often, transparent electoral procedures are the least strategy
resistant, and many honest procedu...
-
The sequences which have trivial prefix-free initial segment
complexity are known as K-trivial sets, and form a cumulative
hierarchy of length ~. We show that the problem of finding the number
of K-trivial sets in the various levels of the hierarchy is
~^0_3. This answers a question of Downey/Mil...