Related papers: Anonymous, non-manipulable, binary social choice
In this paper, we propose a framework to study a general class of strategic behavior in voting, which we call vote operations. We prove the following theorem: if we fix the number of alternatives, generate $n$ votes i.i.d. according to a…
Investigation of partial multiplace functions by algebraic methods plays an important role in modern mathematics were we consider various operations on sets of functions, which are naturally defined. The basic operation for $n$-place…
The Coalitional Manipulation problem has been studied extensively in the literature for many voting rules. However, most studies have focused on the complete information setting, wherein the manipulators know the votes of the…
Abduction is a fundamental and important form of non-monotonic reasoning. Given a knowledge base explaining how the world behaves it aims at finding an explanation for some observed manifestation. In this paper we focus on propositional…
We define the model of an abstract economy with private information and a countable set of actions. We generalize the H. Yu and Z. Zhang's model (2007), considering that each agent is characterised by a preference correspondence instead of…
Voting is a simple mechanism to aggregate the preferences of agents. Many voting rules have been shown to be NP-hard to manipulate. However, a number of recent theoretical results suggest that this complexity may only be in the worst-case…
Fairness problems in recommender systems often have a complexity in practice that is not adequately captured in simplified research formulations. A social choice formulation of the fairness problem, operating within a multi-agent…
Two fundamental axioms in social choice theory are consistency with respect to a variable electorate and consistency with respect to components of similar alternatives. In the context of traditional non-probabilistic social choice, these…
Rabi and Sherman present a cryptographic paradigm based on associative, one-way functions that are strong (i.e., hard to invert even if one of their arguments is given) and total. Hemaspaandra and Rothe proved that such powerful one-way…
We study the operator-valued positive definite functions on a group using positive block matrices. We give an alternative proof to Brehmer positivity for doubly commuting contractions. We classify all commuting unitary representations over…
Following Zhang and Grossi~(AAAI 2021), we study in more depth a variant of weighted voting games in which agents' weights are induced by a transitive support structure. This class of simple games is notably well suited to study the…
Many binary collective choice situations can be described as weighted simple voting games. We introduce weighted committee games to model decisions on an arbitrary number of alternatives in analogous fashion. We compare the effect of…
The original Deffuant model consists of a finite number of agents whose opinion is a number in $[0,1]$. Two socially connected agents are uniformly randomly selected at each time step and approach each other at a rate $\mu\in [0,1/2]$ if…
Agent-based models describing social interactions among individuals can help to better understand emerging macroscopic patterns in societies. One of the topics which is worth tackling is the formation of different kinds of hierarchies that…
When studying safety properties of (formal) protocol models, it is customary to view the scheduler as an adversary: an entity trying to falsify the safety property. We show that in the context of security protocols, and in particular of…
We derive the most probable distribution of resources for a simple society. We find that a probabilistic analysis forbids both too much and too less equity, and selects instead a minimally ordered state. We give the detailed calculations…
The main goal of this article is to investigate the relationship between action accessibility and weak action representability in the context of varieties of non-associative algebras over a field. Specifically, using an argument of J. R. A.…
Two agents trade an item in a simultaneous offer setting, where the exchange takes place if and only if the buyer's bid price weakly exceeds the seller's ask price. Each agent is randomly assigned the buyer or seller role. Both agents are…
We define an enumerative function F(n,k,P,m) which is a generalization of binomial coefficients. Special cases of this function are also power function, factorials, rising factorials and falling factorials. The first section of the paper is…
We study the set of incentive compatible and efficient two-sided matching mechanisms. We classify all such mechanisms under an additional assumption -- "gender-neutrality" -- which guarantees that the two sides be treated symmetrically. All…