The purpose of this note is to compute the probability of logrolling for three different probabilistic cultures. The primary finding is that the restriction of preferences to be in accord with the condition of separable preferences creates enough additional structure among voters’ preference rankings to create an increase in the likelihood that a Condorcet winner will exist with both IC and IAC...

This paper describes a method for planning with rich qualitative, temporally extended preferences (QTEPs) using lookahead heuristics inspired by those employed in state-of-the-art classical planners. Key to our approach is a transformation of the planning domain into an equivalent but simplified planning domain. First, compound preference formulae are transformed into simpler, equivalent prefer...

We consider voting over combinatorial domains, where alternatives are binary tuples. We assume that votes are specified as conditionally lexicographic preferences, or LP trees. We study aggregation problems of LP tree votes for several positional scoring rules. Our main goal is to demonstrate that answer-set programming can be effective in solving the winner and the evaluation problems for inst...

This article tries to explain the exceptional levels of knowledge creation in certain industrial clusters, levels that are seemingly higher than what is implied by the usual models of atomistic agents who do not internalize externalities. For this purpose, we introduce reference-dependent utility into an OLG model of an industrial cluster where agents allocate resources between consumption and ...