Sciweavers

Share
177 search results - page 1 / 36
» Computational Complexity of Fundamental Problems in Social C...
Sort
View
ATAL
2015
Springer
4 years 5 months ago
Computational Complexity of Fundamental Problems in Social Choice Theory
Computational social choice (comsoc) theory is currently an important area of research in computer science and more specifically in AI. The field started with the pioneering wor...
Palash Dey
KER
2008
193views more  KER 2008»
9 years 9 months ago
The 1st international workshop on computational social choice
Computational social choice is a new discipline currently emerging at the interface of social choice theory and computer science. It is concerned with the application of computati...
Ulle Endriss
SIGECOM
2010
ACM
183views ECommerce» more  SIGECOM 2010»
10 years 2 months ago
The unavailable candidate model: a decision-theoretic view of social choice
One of the fundamental problems in the theory of social choice is aggregating the rankings of a set of agents (or voters) into a consensus ranking. Rank aggregation has found appl...
Tyler Lu, Craig Boutilier
DAGSTUHL
2007
9 years 11 months ago
07431 Executive Summary - Computational Issues in Social Choice
Computational social choice is an interdisciplinary eld of study at the interface of social choice theory and computer science, with knowledge owing in either direction. On the o...
Ulle Endriss, Jérôme Lang, Francesca ...
ATAL
2015
Springer
4 years 5 months ago
Three Fundamental Pillars of Multi-agent Team Formation
Teams of voting agents are a powerful tool for solving complex problems. When forming such teams, there are three fundamental issues that must be addressed: (i) Selecting which ag...
Leandro Soriano Marcolino, Milind Tambe
books