Tata Institute of Fundamental Research
Some Non-Recent Advances in Understanding the Complexity of Incentive Compatible Mechanisms
STCS Seminar
Speaker:
Shahar Dobzinski (Weizmann Institute of Science)
Organiser:
Raghuvansh Saxena
Date:
Tuesday, 19 Nov 2024, 16:00 to 17:00
Venue:
via Zoom in A201
(Scan to add to calendar)
Abstract:
How powerful are incentive-compatible polynomial-time algorithms compared to polynomial-time algorithms that are not necessarily incentive-compatible? This question stands at the heart of Algorithmic Mechanism Design and has been extensively studied. This talk will take the form of a survey. We will discuss how to construct good incentive-compatible polynomial time algorithms and how to prove bounds on their power.
Short Bio: Shahar Dobzinski is a faculty member in the Department of Applied Mathematics and Computer Science at the Weizmann Institute of Science. His primary research interests center on algorithmic game theory, focusing on the intersection of algorithms, incentives, and strategic behavior in computational environments.
| Speaker: | Shahar Dobzinski (Weizmann Institute of Science) |
| Organiser: | Raghuvansh Saxena |
| Date: | Tuesday, 19 Nov 2024, 16:00 to 17:00 |
| Venue: | via Zoom in A201 |
(Scan to add to calendar)
Abstract:
How powerful are incentive-compatible polynomial-time algorithms compared to polynomial-time algorithms that are not necessarily incentive-compatible? This question stands at the heart of Algorithmic Mechanism Design and has been extensively studied. This talk will take the form of a survey. We will discuss how to construct good incentive-compatible polynomial time algorithms and how to prove bounds on their power.
Short Bio: Shahar Dobzinski is a faculty member in the Department of Applied Mathematics and Computer Science at the Weizmann Institute of Science. His primary research interests center on algorithmic game theory, focusing on the intersection of algorithms, incentives, and strategic behavior in computational environments.