MIT Open Access Articles

The MIT Open Access Articles collection consists of scholarly articles written by MIT-affiliated authors that are made available through DSpace@MIT under the MIT Faculty Open Access Policy, or under related publisher agreements. Articles in this collection generally reflect changes made during peer-review.

Version details are supplied for each paper in the collection:

  • Original manuscript: author's manuscript prior to formal peer review
  • Author's final manuscript: final author's manuscript post peer review, without publisher's formatting or copy editing
  • Final published version: final published article, as it appeared in a journal, conference proceedings, or other formally published context (this version appears here only if allowable under publisher's policy)

Some peer-reviewed scholarly articles are available through other DSpace@MIT collections, such as those for departments, labs, and centers.

If you are an MIT community member who wants to deposit an article into the this collection, you will need to log in to do so. If you don't have an account, please contact us.

More information:

Recent Submissions

  • Efficient Learning and Computation of Linear Correlated Equilibrium in General Convex Games 

    Daskalakis, Constantinos; Farina, Gabriele; Fishelson, Maxwell; Pipis, Charilaos; Schneider, Jon (ACM|Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025-06-15)
    We propose efficient no-regret learning dynamics and ellipsoid-based methods for computing linear correlated equilibria—a relaxation of correlated equilibria and a strengthening of coarse correlated equilibria—in general ...

  • When Connectivity Is Hard, Random Walks Are Easy with Non-determinism 

    Doron, Dean; Pyne, Edward; Tell, Roei; Williams, R. Ryan (ACM|Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025-06-15)
    Two fundamental problems on directed graphs are to decide s-t connectivity, and to estimate the behavior of random walks. Currently, there is no known algorithm for s-t connectivity running in polynomial time and no(1) ...

  • QMA vs QCMA and Pseudorandomness 

    Liu, Jiahui; Mutreja, Saachi; Yuen, Henry (ACM|Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025-06-15)
    We study a longstanding question of Aaronson and Kuperberg on whether there exists a classical oracle separating QMA from QCMA. Settling this question in either direction would yield insight into the power of quantum proofs ...

View more