We study the problem of elicitation of subjective beliefs of an agent when the beliefs are ambiguous (the set of beliefs is a non-singleton set) and the agent’s preference exhibits ambiguity aversion; in particular, as represented by α-maxmin preferences. We construct a direct revelation mechanism such that truthful reporting of beliefs is the agent’s unique best response. The mechanism uses kn...

This paper examines the nature of partisan preferences on a range of issue scales. It compares preferences in a period of strong ideological focus, in the late eighties and early nineties, with preferences in 2000 and 2001 – a period of weak ideological focus. Where partisan preferences were formerly polarised, they are now more consensual. I argue that once positional issues now resemble valen...

In Dershowitz’s original presentation recursive path orders (RPO) are defined by means of recursion. In Bergstra and Klop’s presentation RPOs are operationally defined by means of a set of term rewrite rules. To distinguish the two presentations, we will refer to the latter as iterative path orders (IPO). We show that IPOs as originally defined by Bergstra and Klop are strictly weaker than RPOs...

Cross efficiency is a method with the idea of peer evaluation instead of self-evaluation, and is used for evaluation and ranking Decision Making Units (DMUs) in Data Envelopment Analysis (DEA). Unlike most existing DEA ranking models which can only rank a subset of DMUs, for example non-efficient or extreme efficient DMUs, cross efficiency can rank all DMUs, even non-extreme ones. However, sinc...

Magda (1980) and Hedayat (1981) first considered the construction of circular strongly balanced repeated measurements designs. Sen and Mukerjee (1987) and Roy (1988) considered the optimality and existence of circular strongly balanced repeated measurements designs based on the method of differences and Hamiltonian decomposition of lexicographic product of two graphs. In this article, we consid...

Given modal logics 1, 2, their lexicographic product 1 ⇤ 2 is a new logic whose frames are the Cartesian products of a 1-frame and a 2-frame, but with the new accessibility relations reminiscent of a lexicographic ordering. This article considers the lexicographic products of several modal logics with linear temporal logic (LTL) based on “next” and “always in the future”. We provide axiomatizat...

In this paper we present a novel termination order the predicative lexicographic path order (PLPO for short), a syntactic restriction of the lexicographic path order. As well as lexicographic path orders, several non-trivial primitive recursive equations, e.g., primitive recursion with parameter substitution, unnested multiple recursion, or simple nested recursion, can be oriented with PLPOs. I...

The predicative lexicographic path order (PLPO for short), a syntactic restriction of the lexicographic path order, is presented. As well as lexicographic path orders, several non-trivial primitive recursive equations, e.g., primitive recursion with parameter substitution, unnested multiple recursion, or simple nested recursion, can be oriented with PLPOs. It can be shown that PLPOs however onl...