Mathematical Optimization for Fair Social Decisions: A Tribute to Michel Balinski.

This document provides a summary of research papers presented at a conference on mathematical optimization for fair social decisions. The conference honored Michel Balinski, a mathematician and economist known for his work in transportation problems, matching algorithms, voting theory, and fair representation. The papers covered a range of topics including optimal partisan gerrymandering, approval-based apportionment, and strategy-proof voting rules. Additionally, the document includes summaries of papers in the fields of network formation problems, game theory, and social choice theory, covering topics such as the median problem, minimum cut problems, network stability, splitting games, price of anarchy, online learning algorithms, cooperative games, and fair division. These summaries provide a quick overview of each paper's main contributions, helping library patrons determine their relevance to their research interests. [Extracted from the article]