EC'25: On approximately fair allocations of indivisible goods
Test of Time Award at the 26th ACM Conference on Economics and Computation (EC'25), Stanford, CA, July 9, 2025: Title: On approximately fair allocations of indivisible goods Authors: Richard J. Lipton, Evangelos Markakis, Elchanan Mossel, Amin Saberi Speakers: Evangelos Markakis, Amin Saberi Session: Awards Session Paper in the ACM Digital Library: https://dl.acm.org/doi/10.1145/988772.988792
Suggested videos
EC'25: Information Design in the Twenty-First Century: A Computer Science Perspective
ACM SIGecom · 25:25
EC'25: Low communication protocols for fair allocation of indivisible goods
ACM SIGecom · 22:45
EC'25: Thought about Economics and Computing and me
ACM SIGecom · 23:22
EC'24 Tutorial: Share-Based Fairness for Indivisible Items (Part 1): Equal entitlements
ACM SIGecom · 44:50
EC'25: Scoring Rules for a Theory of AI
ACM SIGecom · 1:04:07
Ruta Mehta: Allocating Goods, Bads, and Mixed: Fairness and Efficiency through Competitiveness
Israeli Algorithmic Game Theory Seminar · 56:45
EC'25: Swap Regret and Correlated Equilibria Beyond Normal-Form Games
ACM SIGecom · 31:27
Lecture: 20, Fair Allocation- II, Speaker: Dr Rohit Vaish
Department of CSE @ IIT Jodhpur · 50:30
EC'25: Prediction as a Service
ACM SIGecom · 1:09:54
Plant-and-Steal: Truthful Fair Allocations via Predictions (Alon Eden, Hebrew University)
Game Theory at BIU · 1:13:11
EC'25: Moderate Utility
ACM SIGecom · 43:08
EC'24: On the Existence of Envy-Free Allocations Beyond Additive Valuations
ACM SIGecom · 15:09