Ariel Procaccia_September 15 2015

Ariel Procaccia

I am an Assistant Professor in the Computer Science Department at Carnegie Mellon University, and an Affiliated Faculty in the Machine Learning Department. I am also a member of the theory group and the ACO program.

I usually work on problems at the interface of computer science and economics. I write papers, teach courses, serve on various editorial boards and program committees, and, best of all, advise wonderful students and postdocs.

Current Highlights


Spliddit: Provably Fair Solutions

Handbook of Computational Social Choice

Computers and Thought Lecture


Congratulations to Nika Haghtalab for winning a 2016-2018 Microsoft Research PhD fellowship. Nika is co-advised by Avrim Blum and me.

Together with Yonathan Aumann, Steven Brams, and  Jérôme Lang, I am organizing a Dagstuhl workshop on Fair Division. The workshop will take place on June 6-10, 2016.

New Scientist published a “one minute interview” with me about AI and fair division.

I received the IJCAI Computers and Thought Award at IJCAI’15 in Buenos Aires. A narrated video of my presentation at the conference is now available online.

I received a new NSF grant, entitled “Fair Division at Scale”.


The mathematical study of fair division dates back to the 1940s. Nowadays the literature encompasses provably fair solutions for a wide variety of problems, many of them relevant to society at large. But, to date, very few fair division methods have been implemented. Building on its rich history, the field of fair division is poised to impact society on a grander scale, for example, via Spliddit (, a fair division website created by the PI. The overarching theme of this proposal is that the advent of fairness at scale gives rise to novel algorithmic challenges, revolving around the design of methods that are practical, widely applicable, and provably fair. Solutions to these challenges call for a synthesis of ideas from theoretical computer science and microeconomic theory.

The evolution of Spliddit plays a key role in the project: Insights arising from the research will be implemented to improve Spliddit’s publicly accessible methods. Moreover, new applications will be added in order to further widen the website’s reach. The project also includes plans to enhance Spliddit’s educational content through the creation of instructive videos, thereby making the website a valuable learning and teaching resource. Finally, the project contains plans to make a societal impact that extends beyond Spliddit. In particular, the PI will work with California school districts to develop a fair method for allocating unused space.

On a technical level, the thrust of the project is twofold. (i) Dividing indivisible goods: One of five applications currently available on Spliddit, the division of indivisible goods is a notoriously difficult problem from a fair division perspective. To obtain a provably fair method, Spliddit relies on the notion of maximin share (MMS) guarantee. While exact MMS allocations may be infeasible, the project explores several notions of approximation. The project also explores the feasibility boundary of MMS allocations. Foundational algorithmic challenges lie at the heart of these research directions. (ii) Sharing credit: Spliddit’s credit calculator fairly determines the contribution of each individual to a group project, using a method developed by de Clippel et al. Perhaps the method’s most compelling guarantee is impartiality: a player’s report does not affect her own share of the credit. Dividing credit for a scientific paper, with the goal of fairly ordering the authors by contribution, is an especially attractive potential application; but there is no guarantee that players will not be able to affect their position in the resultant ranking. The project aims to circumvent this obstacle via randomization and approximation.

A new version of Spliddit, featuring two new apps and improvements to the old ones, has officially launched!
Press coverage (newest to oldest): New Scientist, Pittsburgh Magazine, GeekWire, NSF podcast, Fast Company, Pittsburgh Post-Gazette, Lifehacker, Slashdot, Gizmodo, Nautilus Magazine, The New York Times.

Congratulations to Nika Haghtalab for winning a 2015-2016 IBM PhD fellowship, with a statement entitled “Learning Theory for Societal Good”. Nika is co-advised by Avrim Blum and me.

I was named a Sloan Research Fellow, together with 125 other young researchers in chemistry, computer science, economics, mathematics, computational and evolutionary molecular biology, neuroscience, ocean sciences, and physics.

Congratulations to Junxing Wang for winning the best student paper award at EC-14, for our joint paper “Fair Enough: Guaranteeing Approximate Maximin Shares”.

Congratulations to Nisarg Shah for winning a 2014-2015 Facebook PhD fellowship, with a statement entitled “Economic Foundations of Social Computing”.  There are 11 winners overall, 3 of whom are from CMU!

Please check back later for more fascinating news!

Contact Information

  •    Computer Science Dept.
  •    Carnegie Mellon University
  •    Pittsburgh, PA 15213
  •    Gates-Hillman Center
  •    Office #9021