Skip to content

ACO Center @ UCI

Algorithms, Combinatorics and Optimization
Search
  • Home
  • People
  • Seminar Series
  • Synergistic Units at UCI
    • ICS
    • Math
    • Business School
    • IMBS
    • EECS
    • Center for Algorithms and Theory of Computation
  • News
  • Contact
  • Home
  • People
  • Seminar Series
  • Synergistic Units at UCI
    • ICS
    • Math
    • Business School
    • IMBS
    • EECS
    • Center for Algorithms and Theory of Computation
  • News
  • Contact
  • Home
  • People
  • Seminar Series
  • Synergistic Units at UCI
    • ICS
    • Math
    • Business School
    • IMBS
    • EECS
    • Center for Algorithms and Theory of Computation
  • News
  • Contact
  • Home
  • People
  • Seminar Series
  • Synergistic Units at UCI
    • ICS
    • Math
    • Business School
    • IMBS
    • EECS
    • Center for Algorithms and Theory of Computation
  • News
  • Contact

Spring 2019

  1. Home>
  2. Seminars>
  3. Spring 2019

The Edgeworth Conjecture with Small Coalitions and Approximate Equilibria in Large Economies

  • Post category:

Continue ReadingThe Edgeworth Conjecture with Small Coalitions and Approximate Equilibria in Large Economies

The Power of Asking More Informative Questions

  • Post category:

Continue ReadingThe Power of Asking More Informative Questions

Matching is as Easy as the Decision Problem, in the NC Model

  • Post category:

Continue ReadingMatching is as Easy as the Decision Problem, in the NC Model

Classical Verification of Quantum Computations

  • Post category:

Continue ReadingClassical Verification of Quantum Computations

A Strongly Polynomial Algorithm for Linear Exchange Markets

  • Post category:

Continue ReadingA Strongly Polynomial Algorithm for Linear Exchange Markets

Statistical Estimation with Strategic Data Holders

  • Post category:

Continue ReadingStatistical Estimation with Strategic Data Holders

Transparency and Control in Platforms & Networked Markets

  • Post category:

Continue ReadingTransparency and Control in Platforms & Networked Markets

Sparse Polynomial Approximations and their applications to Quantum Advantage, Parallel Computation, and Pseudorandomness

  • Post category:

Continue ReadingSparse Polynomial Approximations and their applications to Quantum Advantage, Parallel Computation, and Pseudorandomness
Press Escape to close the search panel.

ACO Center @ UCI • Privacy Policy • © 2026 UC Regents
Skip to content
Open toolbar

Accessibility Tools

  • Increase Text
  • Decrease Text
  • Grayscale
  • High Contrast
  • Negative Contrast
  • Light Background
  • Links Underline
  • Readable Font
  • Reset