Media Summary: Paper presentation at the 25th ACM Conference on Economics and Computation ( Does algorithm design become harder in the presence of incentive constraints? The theory of algorithmic

Ec 24 Tutorial Approximation Mechanisms - Detailed Analysis & Overview

Paper presentation at the 25th ACM Conference on Economics and Computation ( Does algorithm design become harder in the presence of incentive constraints? The theory of algorithmic

Photo Gallery

EC'24 Tutorial: Approximation Mechanisms with Interdependent Values (Part 1): A Biased Introduction
EC'24 Tutorial: Approximation Mechanisms with Interdependent Values (Part 2): Optimal Stopping
EC'24 Tutorial: Approximation Mechanisms with Interdependent Values (Part 3): Private Valuations
EC'24: Optimal Mechanisms for a Value Maximizer: The Futility of Screening Targets
STOC24 7 B 1 Settling the Communication Complexity of VCG based Mechanisms for All Approximation Gua
EC'24: To Trust or Not to Trust: Assignment Mechanisms with Predictions in the Private Graph Model
EC'24: Dynamic Pricing and Learning with Long-term Reference Effects
EC'24 Tutorial: Automated Market Makers (Part 2): Mathematical characterization of the design space
EC'23 Tutorial: Beyond Buy-One in Approximately Optimal Multi-Item Auctions
EC'24: Private Interdependent Valuations: New Bounds for Single-Item Auctions and Matroids
Ilya Segal -Dynamic Mechanism Design: Efficiency and Budget Balance
EC'23 Tutorial: Practical Mechanism Design for Bidders with Bounded Rationality
View Detailed Profile
EC'24 Tutorial: Approximation Mechanisms with Interdependent Values (Part 1): A Biased Introduction

EC'24 Tutorial: Approximation Mechanisms with Interdependent Values (Part 1): A Biased Introduction

Tutorial

EC'24 Tutorial: Approximation Mechanisms with Interdependent Values (Part 2): Optimal Stopping

EC'24 Tutorial: Approximation Mechanisms with Interdependent Values (Part 2): Optimal Stopping

Tutorial

EC'24 Tutorial: Approximation Mechanisms with Interdependent Values (Part 3): Private Valuations

EC'24 Tutorial: Approximation Mechanisms with Interdependent Values (Part 3): Private Valuations

Tutorial

EC'24: Optimal Mechanisms for a Value Maximizer: The Futility of Screening Targets

EC'24: Optimal Mechanisms for a Value Maximizer: The Futility of Screening Targets

Paper presentation at the 25th ACM Conference on Economics and Computation (

STOC24 7 B 1 Settling the Communication Complexity of VCG based Mechanisms for All Approximation Gua

STOC24 7 B 1 Settling the Communication Complexity of VCG based Mechanisms for All Approximation Gua

Mechanisms

EC'24: To Trust or Not to Trust: Assignment Mechanisms with Predictions in the Private Graph Model

EC'24: To Trust or Not to Trust: Assignment Mechanisms with Predictions in the Private Graph Model

Paper presentation at the 25th ACM Conference on Economics and Computation (

EC'24: Dynamic Pricing and Learning with Long-term Reference Effects

EC'24: Dynamic Pricing and Learning with Long-term Reference Effects

Paper presentation at the 25th ACM Conference on Economics and Computation (

EC'24 Tutorial: Automated Market Makers (Part 2): Mathematical characterization of the design space

EC'24 Tutorial: Automated Market Makers (Part 2): Mathematical characterization of the design space

Tutorial

EC'23 Tutorial: Beyond Buy-One in Approximately Optimal Multi-Item Auctions

EC'23 Tutorial: Beyond Buy-One in Approximately Optimal Multi-Item Auctions

Tutorial

EC'24: Private Interdependent Valuations: New Bounds for Single-Item Auctions and Matroids

EC'24: Private Interdependent Valuations: New Bounds for Single-Item Auctions and Matroids

Paper presentation at the 25th ACM Conference on Economics and Computation (

Ilya Segal -Dynamic Mechanism Design: Efficiency and Budget Balance

Ilya Segal -Dynamic Mechanism Design: Efficiency and Budget Balance

Ilya Segal (Stanford University) Dynamic

EC'23 Tutorial: Practical Mechanism Design for Bidders with Bounded Rationality

EC'23 Tutorial: Practical Mechanism Design for Bidders with Bounded Rationality

Tutorial

Converting any Algorithm into an Incentive-Compatible Mechanism

Converting any Algorithm into an Incentive-Compatible Mechanism

Does algorithm design become harder in the presence of incentive constraints? The theory of algorithmic