265,092 research outputs found
Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges
Computational Social Choice is an interdisciplinary research area involving
Economics, Political Science, and Social Science on the one side, and
Mathematics and Computer Science (including Artificial Intelligence and
Multiagent Systems) on the other side. Typical computational problems studied
in this field include the vulnerability of voting procedures against attacks,
or preference aggregation in multi-agent systems. Parameterized Algorithmics is
a subfield of Theoretical Computer Science seeking to exploit meaningful
problem-specific parameters in order to identify tractable special cases of in
general computationally hard problems. In this paper, we propose nine of our
favorite research challenges concerning the parameterized complexity of
problems appearing in this context
Credimus
We believe that economic design and computational complexity---while already
important to each other---should become even more important to each other with
each passing year. But for that to happen, experts in on the one hand such
areas as social choice, economics, and political science and on the other hand
computational complexity will have to better understand each other's
worldviews.
This article, written by two complexity theorists who also work in
computational social choice theory, focuses on one direction of that process by
presenting a brief overview of how most computational complexity theorists view
the world. Although our immediate motivation is to make the lens through which
complexity theorists see the world be better understood by those in the social
sciences, we also feel that even within computer science it is very important
for nontheoreticians to understand how theoreticians think, just as it is
equally important within computer science for theoreticians to understand how
nontheoreticians think
Social Choice Around the Block:On the Computational Social Choice of Blockchain
One of the most innovative aspects of blockchain technology consists in the introduction of an incentive layer to regulate the behavior of distributed protocols. The designer of a blockchain system faces therefore issues that are akin to those relevant for the design of economic mechanisms, and faces them in a computational setting. From this perspective the present paper argues for the importance of computational social choice in blockchain research. It identifies a few challenges at the interface of the two fields that illustrate the strong potential for cross-fertilization between them.</p
10101 Executive Summary -- Computational Foundations of Social Choice
This seminar addressed some of the key issues in computational social choice, a novel interdisciplinary field of study at the interface of social choice theory and computer science. Computational social choice is concerned with the application of computational techniques to the study of social choice mechanisms, such as voting rules and fair division protocols, as well as with the integration of social choice paradigms into computing. The seminar brought together many of the most active researchers in the field and focussed the research community currently forming around these important and exciting topics
Computational Social Choice: Prospects and Challenges
AbstractHow should we aggregate the individual views of the members of a group so as to arrive at an adequate representation of the collective view of that group? This is a fundamental question of deep philosophical, economic, and political significance that, around the middle of 20th century, has given rise to the field of Social Choice Theory. More recently, a research trend known as Computational Social Choice has emerged, which studies this question from the perspective of Computer Science. This “computational turn” is fuelled both by the fact that questions of social choice have turned out to be central to a range of application areas, notably in the domain of Information and Communication Technologies, and by the insight that many concepts and techniques originating in Computer Science can be used to solve (or provide a new angle on) problems in Social Choice Theory. In this paper, I give a brief introduction to Computational Social Choice and discuss some of the prospects and challenges for this fast growing area of research
The Ribbon of Love: Fuzzy-Ruled Agents in Artificial Societies
The paper brings two motivations to the theoretical explorations of social analysis. The first is to enrich the agent based computational sociology by incorporating the fuzzy set theory in to the computational modeling. This is conducted by showing the importance to include the fuzziness into artificial agent’s considerations and her way acquiring and articulate information. This is continued with the second motives to bring the Darwinian sexual selection theory – as it has been developed broadly in evolutionary psychology – into the analysis of social system including cultural analysis and other broad aspects of sociological fields. The two was combined in one computational model construction showing the fuzziness of mating choice, and how to have computational tools to explain broad fields of social realms. The paper ends with some opened further computer program development
- …