My Account Log in

1 option

Strategic Voting / by Reshef Meir.

Springer Nature Synthesis Collection of Technology Collection 8 Available online

View online
Format:
Book
Author/Creator:
Meir, Reshef., Author.
Series:
Synthesis Lectures on Artificial Intelligence and Machine Learning, 1939-4616
Language:
English
Subjects (All):
Artificial intelligence.
Machine learning.
Neural networks (Computer science).
Artificial Intelligence.
Machine Learning.
Mathematical Models of Cognitive Processes and Neural Networks.
Local Subjects:
Artificial Intelligence.
Machine Learning.
Mathematical Models of Cognitive Processes and Neural Networks.
Physical Description:
1 online resource (XVII, 149 p.)
Edition:
1st ed. 2018.
Place of Publication:
Cham : Springer Nature Switzerland : Imprint: Springer, 2018.
Summary:
Social choice theory deals with aggregating the preferences of multiple individuals regarding several available alternatives, a situation colloquially known as voting. There are many different voting rules in use and even more in the literature, owing to the various considerations such an aggregation method should take into account. The analysis of voting scenarios becomes particularly challenging in the presence of strategic voters, that is, voters that misreport their true preferences in an attempt to obtain a more favorable outcome. In a world that is tightly connected by the Internet, where multiple groups with complex incentives make frequent joint decisions, the interest in strategic voting exceeds the scope of political science and is a focus of research in economics, game theory, sociology, mathematics, and computer science. The book has two parts. The first part asks "are there voting rules that are truthful?" in the sense that all voters have an incentive toreport their true preferences. The seminal Gibbard-Satterthwaite theorem excludes the existence of such voting rules under certain requirements. From this starting point, we survey both extensions of the theorem and various conditions under which truthful voting is made possible (such as restricted preference domains). We also explore the connections with other problems of mechanism design such as locating a facility that serves multiple users. In the second part, we ask "what would be the outcome when voters do vote strategically?" rather than trying to prevent such behavior. We overview various game-theoretic models and equilibrium concepts from the literature, demonstrate how they apply to voting games, and discuss their implications on social welfare. We conclude with a brief survey of empirical and experimental findings that could play a key role in future development of game theoretic voting models.
Contents:
Preface
Acknowledgments
Introduction
Basic Notation
Strategyproofness and the Gibbard
Satterthwaite Theorem
Regaining Truthfulness in Voting
Voting and Mechanism Design
Simultaneous Voting Games
Iterative and Sequential Voting
Voting Heuristics
Summary: Toward a Complete Theory of Strategic Voting
Bibliography
Author's Biography .
ISBN:
9783031015793
3031015797

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

Find

Home Release notes

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Find catalog Using Articles+ Using your account