TCS+ talk *this week*: Wednesday, November 20, Divyarthi Mohan, Boston University
Clement Canonne
This is a reminder that the next TCS+ talk is taking place this week, Wednesday, November 20th at 1:00 PM Eastern Time (10:00 AM Pacific Time, 19:00 Central European Time, 18:00 UTC). The speakers' slides will be made available at https://sites.google.com/view/tcsplus/welcome/past-talks before the talk starts.
If you’d like to join the Zoom talk, please sign up using the form at https://sites.google.com/view/tcsplus/welcome/next-tcs-talk. The talk will also be recorded and posted shortly afterwards on our YouTube channel, here: http://www.youtube.com/user/TCSplusSeminars.
Hoping to see you all there,
The organizers
-------------------------------
Speaker: Divyarthi Mohan (Boston University)
Title: Optimal Stopping with Interdependent Values
Abstract: We study online selection problems in both the prophet and secretary settings, when arriving agents have interdependent values. In the interdependent values model, introduced in the seminal work of Milgrom and Weber [1982], each agent has a private signal and the value of an agent is a function of the signals held by all agents. Results in online selection crucially rely on some degree of independence of values, which is conceptually at odds with the interdependent values model. For prophet and secretary models under the standard independent values assumption, prior works provide constant factor approximations to the welfare. On the other hand, when agents have interdependent values, prior works in Economics and Computer Science provide truthful mechanisms that obtain optimal and approximately optimal welfare under certain assumptions on the valuation functions. We bring together these two important lines of work and provide the first constant factor approximations for prophet and secretary problems with interdependent values. We consider both the algorithmic setting, where agents are non-strategic (but have interdependent values), and the mechanism design setting with strategic agents. All our results are constructive and use simple stopping rules.
Joint work with Simon Mauras and Rebecca Reiffenhäuser.
Bio: Divyarthi Mohan is a postdoctoral researcher at Boston University hosted by Prof. Kira Goldner. Previously, she was a postdoc at Tel Aviv University with Prof. Michal Feldman. She obtained her PhD in Computer Science at Princeton University in July 2021 advised by Prof. Matt Weinberg. Divya's research interest broadly lies at the intersection of computer science and economics, with a focus on algorithmic mechanism design, social learning and strategic communication. She was awarded the class of 2021 Siebel Scholarship and the Simons-Berkeley Research Fellowship for Fall 2022.
Clement Canonne
The link for tomorrow's TCS+ talk has been posted: you will be able to join tomorrow, starting at 12:50pm ET:
https://berkeley.zoom.us/j/98954371813?pwd=V1hxN2Nrc2c5OEJFSWRqS29JeWM1dz09 (you will need a to be logged in on Zoom to join: a free account suffices)
Best,
-- Clément, on behalf of the TCS+ team
________________________________________
From: Clement Canonne <clement...@sydney.edu.au>
Sent: Tuesday, November 19, 2024 10:52 AM
To: tcsplus_...@googlegroups.com
Subject: TCS+ talk *this week*: Wednesday, November 20, Divyarthi Mohan, Boston University