YoVDO

Approximation Schemes for a Unit-Demand Buyer with Independent Items via Symmetries

Offered By: IEEE via YouTube

Tags

Approximation Algorithms Courses Algorithmic Game Theory Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a 21-minute IEEE conference talk that delves into approximation schemes for a unit-demand buyer with independent items, utilizing symmetries. Learn from experts Pravesh Kothari, Divyarthi Mohan, Ariel Schvartzman, Sahil Singla, and S. Matthew Weinberg as they present their research findings and insights on this complex topic in computer science and economics.

Syllabus

Approximation Schemes for a Unit-Demand Buyer with Independent Items via Symmetries


Taught by

IEEE FOCS: Foundations of Computer Science

Tags

Related Courses

Approximation Algorithms Part I
École normale supérieure via Coursera
Approximation Algorithms Part II
École normale supérieure via Coursera
Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
Stanford University via Coursera
Algorithm Design and Analysis
University of Pennsylvania via edX
Delivery Problem
University of California, San Diego via Coursera