Fall 2022 Econ CS Seminars

2022 Sep 30

Learning-Robust Mechanisms and the Coordination Bias

1:00pm to 2:30pm

Location: 

SEC 1.413 & on Zoom here: https://harvard.zoom.us/j/97692964231?pwd=K05BMEhDNTZtbUhHYkZ5S21qZ2FKQT09#success

Speaker:  Martino Banchio

Title:  Learning-Robust Mechanisms and the Coordination Bias

Abstract:
We develop a theoretical model to study strategic interactions between adaptive learning algorithms. Applying continuous-time techniques, we uncover the mechanisms responsible for recently documented experimental evidence of such algorithms learning to charge supracompetitive...

Read more about Learning-Robust Mechanisms and the Coordination Bias
2022 Sep 23

Designing convex surrogates for discrete prediction tasks via embeddings

1:00pm to 2:30pm

Location: 

SEC 1.413

We will have our long-awaited student back-to-back talk after two years. It will be in-person and each talk takes 25 minutes including the Q&A. For this week we have:

Speaker: Jessie Finocchiaro, Harvard

Title: Designing convex surrogates for discrete prediction tasks via embeddings

Abstract: We formalize and study the natural approach of designing convex surrogate loss functions via embeddings, for problems such as classification, ranking, or structured prediction. In this...

Read more about Designing convex surrogates for discrete prediction tasks via embeddings
2022 Sep 09

Fairness Constraints on Graphs

1:00pm to 2:30pm

Location: 

SEC 1.413

Speaker: Rik Sengupta, UMass Amherst

Title: Fairness Constraints on Graphs

Abstract: In most of the fair allocation literature about indivisible goods, the fairness constraint under consideration is between *all* pairs of agents. But this is often not representative of the real world, where we only typically care about (and get envious of) the people we actually know. This gives rise to a natural relaxation of many fair allocation problems, where we place agents...

Read more about Fairness Constraints on Graphs