We study implementability in dominant strategies of social choice functions when sets of types are multi-dimensional and convex, sets of outcomes are arbitrary, valuations for outc...
We show how a well-known superposition-based inference system for first-order equational logic can be used almost directly as a decision procedure for various theories including l...
We define two negotiation protocols for Group Decision Making, which main feature is the existence of acceptation thresholds. In order to predict which consensus are expected to ...
Abstract. The decision problem for positively quantified formulae in the theory of linearly ordered Heyting algebras is known, as a special case of work of Kreisel, to be solvable;...
Dyadic data matrices, such as co-occurrence matrix, rating matrix, and proximity matrix, arise frequently in various important applications. A fundamental problem in dyadic data a...