Omer Reingold – författare

Seeing fairness through a computational lensMore and more of the decisions that shape our lives are driven by algorithms: what healthcare we receive, what loans we are offered, whom we date, the news we read, the schools we attend, and the jobs we get. These systems do not merely assist human decisions; they structure the very processes through which decisions are made. Today, asking to be treated fairly often means asking that algorithms treat us fairly.In Equal under the Algorithm, Omer Reingold explores the question of algorithmic fairness and, more broadly, fairness itself. He guides readers toward a deeper understanding of algorithms, explaining the mathematical language in which they operate, the power they wield, and the computational limits that shape what can realistically be demanded of them. Moving seamlessly between mathematics and philosophy, he shows how formal definitions of fairness capture different moral commitments and why some fairness ideals cannot be satisfied. Fairness, he argues, is plural.Reingold discusses fairness in resource allocation through relatable problems, from dividing a cake fairly (who gets the bigger piece? frosting or sprinkles?) to allocating medical internships and other scarce opportunities. He explains machine learning through a fairness lens and shows how biases in applications such as screening and recruiting tools emerge not only from discriminatory intent but also from the hidden assumptions embedded in our data and definitions. Inviting readers into a conversation that should not be left to experts alone, Reingold clarifies the stakes of a debate often dominated by jargon and slogans.

This volume presents the refereed proceedings of the 10th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and the 11th International Workshop on Randomization and Computation. The papers cover design and analysis of approximation algorithms, hardness of approximation, small space and data streaming algorithms, sub-linear time algorithms, embeddings and metric space methods, and much more.

TCC 2009, the 6th Theory of Cryptography Conference, was held in San Fr- cisco, CA, USA, March 15–17, 2009. TCC 2009 was sponsored by the Inter- tional Association for Cryptologic Research (IACR) and was organized in - operation with the Applied Crypto Group at Stanford University. The General Chair of the conference was Dan Boneh. The conference received 109 submissions, of which the Program Comm- tee selected 33 for presentation at the conference. These proceedings consist of revised versions of those 33 papers. The revisions were not reviewed, and the authors bear full responsibility for the contents of their papers. The conference program also included two invited talks: “The Di?erential Privacy Frontier,” given by Cynthia Dwork and “Some Recent Progress in Lattice-Based Crypt- raphy,” given by Chris Peikert. I thank the Steering Committee of TCC for entrusting me with the resp- sibility for the TCC 2009 program. I thank the authors of submitted papers for their contributions. The general impression of the Program Committee is that the submissions were of very high quality, and there were many more papers we wanted to accept than we could. The review process was therefore very - warding but the selection was very delicate and challenging. I am grateful for the dedication, thoroughness,and expertise ofthe ProgramCommittee. Obse- ing the way the members of the committee operated makes me as con?dent as possible of the outcome of our selection process.