2024 Motwani Postdoc Announced theorydish.blog/2023/10/30/202…

Following up on previous years' compilations of Market Design job-market profiles, Assaf Romm Ran Shorrer and I are compiling an edition for this job market. Last year, in early October, we sent out a call to job market candidates to submit their profiles to our annual list,

On the job market, please feel free to use a completely canned cover letter. I have never read them, and as far as I can tell neither have my colleagues.

Quantum Communication Complexity of Classical Auctions. (arXiv:2311.12444v1 [cs.GT]) arxiv.org/abs/2311.12444

The STOC/TheoryFest 2024 call for workshops has been posted. The deadline for proposals is Feb 16! The conference will be held in Vancouver, June 24-28. acm-stoc.org/stoc2024/callf… #STOC2024 #Theoryfest2024

Here is a 3 page paper giving a super-simple deterministic online algorithm that guarantees 2√T distance to calibration. The analysis is only 1 page (the first 2 pages are chit chat). It has a "Follow the perturbed leader" flavor. arxiv.org/abs/2402.11410

Postdoc opportunity to work on collaborative healthcare related projects with several Stanford faculty postdocs.stanford.edu/prospective/op…

Traditional swap regret algorithms are not monotone! But recent ones are, and we give a reduction that lets you use them in the limited feedback setting that arises here. For more on learning in principal agent problems, check out the paper: arxiv.org/abs/2402.17108

Along with Amir Abboud and Nick Fischer, I'm organizing a tutorial in Fine-grained complexity in July 2024, primarily for graduate students. The website to apply is: dimacs.rutgers.edu/events/details….

Are you a TCS grad student who doesn't know much about fine-grained complexity, but wish you did? Check out the DIMACS Tutorial on Fine-grained Complexity that Karthik C. S., Amir Abboud, and Nick Fischer are organizing for July 15-19, 2024: dimacs.rutgers.edu/events/details…

Sebastien Bubeck Amazing, we basically did the same last semester in the introduction to algorithms course at EPFL with 500+ students. Every week the students got to teach two of the most important concepts/algorithms to an LLM instructed to learn and ask questions about those concepts.

Occasionally in mathematics a statement that just has to be true turns out to be false. A paper appeared on arXiv today that disproves a well-known conjecture in probability called the bunkbed conjecture. 🧵 arxiv.org/abs/2410.02545

Over the past three summers a16z crypto we've had 19 tremendous research interns. Want to be part of the summer '25 cohort? The application is open now, for full consideration apply by Nov 8. (Link in replies.)

NBER market design workshop at Stanford, tomorrow and Saturday marketdesigner.blogspot.com/2024/10/nber-m…

Looks like Jamboard is actually frozen :( Good (hopefully free) alternatives? Ideally ones where we can both easily draw and write latex?

o1-preview one-shots my hardest programming interview question. What do I do?

algorithmic feeds are the first at-scale misaligned AIs

Postdoc opportunity: if interested in a postdoc related to sketching starting Summer/Fall'25, especially applied to more efficient foundation model architectures (e.g. faster approx attention), please follow the instructions on the left column of theory.cs.berkeley.edu/postdoc.html by Jan 31