We study multiple referenda and committee elections, when the ballot of each voter is simply a set of approved binary issues (or candidates). Two well-known rules under this model...
Motivated by allocation and pricing problems faced by service requesters on modern crowdsourcing platforms, we study a multi-armed bandit (MAB) problem with several realworld feat...
Arpita Biswas, Shweta Jain, Debmalya Mandal, Y. Na...
The probabilistic serial (PS) rule is one of the most prominent randomized rules for the assignment problem. It is well-known for its desirable fairness and welfare properties. Ho...
Haris Aziz, Serge Gaspers, Simon Mackenzie, Nichol...
We show that without using any domain knowledge, we can predict the final performance of a team of voting agents, at any step towards solving a complex problem. This demo allows ...
Coalition formation provides a versatile framework for analyzing cooperative behavior in multi-agent systems. In particular, hedonic coalition formation has gained considerable at...
We address the question of how an agent can adapt its behavior to comply with newly adopted norms. This is particularly relevant in the case of open systems where agents may enter...
M. Birna van Riemsdijk, Louise A. Dennis, Michael ...
The demonstration is showing a mobile application (2-player game), utilizing context-awareness relying on agents. The agents are gathering and processing context-data retrieved fr...