- About
- Events
- Calendar
- Graduation Information
- Cornell Tech Colloquium
- Student Colloquium
- Student Recognition
- 2020 Celebratory Event
- BOOM
- CS Colloquium
- SoNIC Workshop
- Conway-Walker Lecture Series
- Salton Lecture Series
- Seminars / Lectures
- Big Red Hacks
- Cornell University High School Programming Contest
- Game Design Initiative
- CSMore: The Rising Sophomore Summer Program in Computer Science
- Explore CS Research
- Research Night
- People
- Courses
- Research
- Undergraduate
- M Eng
- MS
- PhD
- Admissions
- Current Students
- Ph.D. Requirements
- Business Card Policy
- Computer Science Graduate Office Hours
- CornellTech
- Curricular Practical Training
- Exam Scheduling Guidelines
- Fellowship Opportunities
- Field A Exam Summary Form
- Graduate School Forms
- Special Committee Selection
- The Outside Minor Requirement
- Travel Funding Opportunities
- Diversity and Inclusion
- Graduation Information
- CS Graduate Minor
- Outreach Opportunities
- Parental Accommodation Policy
- Special Masters
- Contact PhD Office
Speaker
Friday, March 12, 2021 - 11:25 to 12:40
Streaming via Zoom
Host:
Thorsten Joachims
Categories:
Understanding Fairness in Online Allocation (via Zoom)
Abstract: In many settings, resources are allocated among agents over time without the use of monetary transfers: cloud resources among researchers, food among food banks, vaccines among states, etc. The stated aim is to try and be 'fair' in these allocations...but what exactly do we mean?
Understanding fairness in allocation settings is one of the most beautiful and relevant topics today, with deep connections to market design, optimization and normative philosophy. I will start from a foundational result of Varian's that relates these streams, and in a certain sense, orients our current approach to fairness. Building off from this, I will describe some of our work in (a) understanding market mechanisms for fair online allocation based on artificial credits, (b) the power and limits of optimization approaches, and (c) how modern ideas in control and online decision-making give surprisingly strong algorithms and performance guarantees for practical online fair allocation.
Bio: Sid Banerjee is an Assistant Professor in the School of Operations Research and Information Engineering (ORIE) at Cornell, as well as a field member in the CS and ECE Departments and the Center for Applied Mathematics. His research is on stochastic modeling and control, and the design of algorithms and incentives for large-scale systems. He got his PhD in ECE from UT Austin, and worked as a postdoctoral researcher in the Social Algorithms Lab at Stanford, as well as a technical consultant at Lyft. His work is supported by an NSF CAREER award, and grants from the NSF and ARL.