15-896 Truth, Justice, and Algorithms
12 units, Carnegie Mellon University
Truth, Justice, and Algorithms is an interdisciplinary course that covers selected theoretical topics at the interface of computer science and economics. The courses topics include computational social choice, e.g., voting rules as maximum likelihood estimators, the axiomatic approach to ranking systems and crowdsourcing, manipulation of elections and ways to circumvent it cooperative games, focusing on solution concepts such as the core and the Shapley value, and their computation fair division algorithms for allocating divisible and indivisible goods, and approximate notions of fairness online matching algorithms competitive analysis, not dating and kidney exchange noncooperative games, including Nash equilibrium and correlated equilibrium, their computation, connections to learning theory, Stackelberg security games, and the price of anarchy in congestion and routing games and topics in social networks such as the diffusion of technologies and influence maximization. Please refer to httpswww.cs.cmu.educsdgradcourseschedulef18.html for the most recent schedule updates Class will not begin until the week of September 4th.
Prerequisites: none listed
Courseweave needs JavaScript to show sections, workloads and planning tools.