-
Many problems arising in computational social choice are of high
computational complexity, and some are located at higher levels of the
Polynomial Hierarchy. We argue that a parameterized complexity
analysis provides a lot of insight about the factors contributing to
the complexity of these probl...
-
Suppose a number of agents each provide us with a directed graph
over a common set of vertices. Graph aggregation is the problem
of computing a single “collective” graph that best represents the
information inherent in this profile of individual graphs. We consider
this aggregation problem fr...
-
We address the problem of specifying a voting rule by means
of a series of examples. Each example consists of the answer
to a simple question: how should the rule rank two alternatives,
given the positions at which each voter ranks the two alternatives?
To be able to formalise this elicitatio...
-
We introduce a general framework for measuring the degree
of diversity in the preferences held by the members of a group.
We formalise and investigate three specific approaches within
that framework: diversity as the range of distinct views held,
diversity as aggregate distance between indivi...
-
Social choice theory is the study of mechanisms for collective
decision making. While originally concerned with modelling and
analysing political decision making in groups of people, its basic
principles, arguably, are equally relevant to modelling and analysing
the kinds of interaction taking...
-
Music Information Retrieval (MIR) is a fundamentally interdisciplinary
field. Nonetheless, a number of presentations at previous ISMIR
conferences have noted that there are some fields to which MIR
seems to have a natural connection but with which there have been
relatively fewer collaboration...
-
NNIL-formulas are propositional formulas that do not allow nesting of
implication to the left. These formulas were introduced in [16], where
it was shown that NNIL-formulas are (up to provable equivalence)
exactly the formulas that are preserved under taking submodels of
Kripke models. In this pa...
-
We study the learning power of iterated belief-revision methods. Successful learning is understood as convergence to correct, i.e., true, beliefs. We focus on the issue of universality: whether or not a particular belief-revision method is able to learn everything that in principle is learnable. ...
-
-
-
We introduce the concept of a subordination, which is dual to the well-known concept of a precontact on a Boolean algebra. We develop a full categorical duality between Boolean algebras with a subordination and Stone spaces with a closed relation, thus generalizing the results of [14]. We introdu...