text-only page produced automatically by Usablenet Assistive Skip all navigation and go to page content Skip top navigation and go to directorate navigation Skip top navigation and go to page navigation
National Science Foundation
design element
Search Awards
Recent Awards
Presidential and Honorary Awards
About Awards
Grant Policy Manual
Grant General Conditions
Cooperative Agreement Conditions
Special Conditions
Federal Demonstration Partnership
Policy Office Website

Award Abstract #1350598

CAREER: A Broad Synthesis of Artificial Intelligence and Social Choice

Div Of Information & Intelligent Systems
divider line
Initial Amendment Date: February 12, 2014
divider line
Latest Amendment Date: February 9, 2016
divider line
Award Number: 1350598
divider line
Award Instrument: Continuing grant
divider line
Program Manager: Hector Munoz-Avila
IIS Div Of Information & Intelligent Systems
CSE Direct For Computer & Info Scie & Enginr
divider line
Start Date: February 15, 2014
divider line
End Date: January 31, 2019 (Estimated)
divider line
Awarded Amount to Date: $314,057.00
divider line
Investigator(s): Ariel Procaccia arielpro@cs.cmu.edu (Principal Investigator)
divider line
Sponsor: Carnegie-Mellon University
5000 Forbes Avenue
PITTSBURGH, PA 15213-3815 (412)268-9527
divider line
divider line
Program Reference Code(s): 1045, 7796, 7932, 7495
divider line
Program Element Code(s): 7495, 7796


Social choice theory is the field that studies the aggregation of individual preferences toward a collective choice. While the artificial intelligence (AI) community has so far played a dominant role in the study of the computational aspects of social choice, the interaction between core AI paradigms and social choice theory has been surprisingly limited.

This project is enhancing the interaction between the two fields through a synthesis of social choice with the following AI areas: (i) decision making under uncertainty, by building on models studied in AI to create new ways to model, analyze, and make decisions in environments where preferences are dynamically changing; (ii) multiagent systems, by studying settings where agents randomly vote over multiple states, and investigating the connection between normative properties and system performance; and finally (iii) machine learning, by employing insights about strategic behavior under structured preferences, developed in the social choice literature, in order to design regression learning algorithms that discourage strategic manipulation.

An overarching goal of this project is to demonstrate the potential of social choice theory to AI researchers, and ultimately to establish social choice theory as a standard paradigm in AI. Equally importantly, this project is expected to increase the scope of social choice theory. Broader impacts include a new web-based voting system, which has the potential to serve and educate hundreds of thousands of users; dissemination through a new book on computational social choice; and a workshop on computational social choice, which will help set a new agenda for the field.


Note:  When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

(Showing: 1 - 10 of 15)
  Show All

Amit Datta, Anupam Datta, Ariel D. Procaccia, and Yair Zick. "Influence in Classification via Cooperative Game Theory," IJCAI'15, 2015.

Ariel D. Procaccia and Nisarg Shah. "Is Approval Voting Optimal Given Approval Votes?," NIPS'15, 2015.

Ariel D. Procaccia and Nisarg Shah. "Optimal Aggregation of Uncertain Preferences," AAAI'16, 2016.

Ariel D. Procaccia, Nisarg Shah, and Eric Sodomka. "Ranked Voting on Social Networks," IJCAI'15, 2015.

Ariel D. Procaccia, Nisarg Shah, and Yair Zick. "Voting Rules As Error-Correcting Codes," AAAI'15, 2015.

Ariel D. Procaccia, Nisarg Shah, and Yair Zick. "Voting Rules As Error-Correcting Codes," Artificial Intelligence, v.231, 2016.

Avrim Blum, John P. Dickerson, Nika Haghtalab, Ariel D. Procaccia, Tuomas Sandholm, and Ankit Sharma. "Ignorance is Almost Bliss: Near-Optimal Stochastic Matching With Few Queries," EC'15, 2015.

David Kurokawa, Ariel D. Procaccia, and Junxing Wang. "When Can the Maximin Share Guarantee Be Guaranteed?," AAAI'16, 2016.

David Kurokawa, Ariel D. Procaccia, and Nisarg Shah. "Leximin Allocations in the Real World," EC'15, 2015.

David Kurokawa, Omer Lev, Jamie Morgenstern, and Ariel D. Procaccia. "Impartial Peer Review," IJCAI'15, 2015.

(Showing: 1 - 10 of 15)
  Show All


Please report errors in award information by writing to: awardsearch@nsf.gov.



Print this page
Back to Top of page
Research.gov  |  USA.gov  |  National Science Board  |  Recovery Act  |  Budget and Performance  |  Annual Financial Report
Web Policies and Important Links  |  Privacy  |  FOIA  |  NO FEAR Act  |  Inspector General  |  Webmaster Contact  |  Site Map
National Science Foundation Logo
The National Science Foundation, 4201 Wilson Boulevard, Arlington, Virginia 22230, USA
Tel: (703) 292-5111, FIRS: (800) 877-8339 | TDD: (800) 281-8749
  Text Only Version