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

Algorithmic Game Theory
Indian Institute of Technology, Kharagpur via Swayam
Theory Seminar - Submodular Maximization
Paul G. Allen School via YouTube
Mechanisms for a No-Regret Agent - Beyond the Common Prior
IEEE via YouTube
Resolving the Optimal Metric Distortion Conjecture
IEEE via YouTube
Algorithmic Game Theory - Session 8C
IEEE via YouTube