Just like in the last 11 years, this year there will be an article in SIGecom Exchanges profiling the current junior job market candidates from the SIGecom community. These profiles will include a res...

We construct an oracle relative to which $\mathsf{BQP} \not\subseteq \mathsf{IP}$, resolving a long-standing open question in quantum complexity theory. Together with recent work due to Aaronson...

The $k$-server conjecture states that a deterministic online algorithm can achieve competitive ratio $k$ on every metric space. We prove the conjecture. Specifically, we show that the work function al...

Easy Peasy at EC'26 — a workshop on elegant, teachable proofs and results in Economics & Computation, held at EC'26 in Rome, July 2026.

European Association for Theoretical Computer Science

We study the computational complexity of the problem of computing local min-max equilibria of games with a nonconvex-nonconcave utility function $f$. From the work of Daskalakis, Skoulakis, and Zampet...

POSITION SUMMARY Quanta Magazine is seeking a first-rate reporter and writer to identify and cover newsworthy developments in mathematics. The ideal candidate will have tireless appetite for exploring...

Job #AJO30865, Postdoc in Theoretical Computer Science at Stanford, Computer Science/Theory Lab/Stanford University, Stanford University, Stanford, California, US

Just like in the last 10 years, this year there will be an article in SIGecom Exchanges profiling the current junior job market candidates from the SIGecom community. These profiles will include a res...

I'll post market design related news and items about repugnant markets. See also my Stanford profile. I have a general-interest book on market design: Who Gets What--and Why The subtitle is "The new economics of matchmaking and market design."

If you are able and willing to participate in the review process, please sign up at this form. Feel free to share this call with your colleagues.

Let's get together and create or edit Wikipedia pages for EconCS entries. Both new and experienced Wiki editors are welcome!

Please fill out the following information to help us plan the event. Please note: participants are asked to bring their own laptop or other device. Power outlets and snacks will be provided. Suggest ...

Congratulations to Xiao Mao, a CS PhD student and advisee of Aviad Rubinstein. He co-authored a paper titled "Breaking the Sorting Barrier for Directed Single-Source Shortest Paths," which w...

YouTube video by Mary Wootters

Title: How to Appease a Voter Majority