15:00 to 16:00
Seminar

Quantifying the Inefficiency of Game-Theoretic Equilibria

Tim Roughgarden
Algorithms and science
15:00 to 16:00
    Guillaume-Budé Amphitheater, Marcelin-Berthelot Site
    Open to all, subject to availability
    -

    Speaker(s)

    Tim Roughgarden

    Stanford University

    Events

    The complexity of hazards
    Bernard Chazelle

    Lecture
    14:00 to 15:00

    Risk and Complexity in Cryptography
    Jacques Stern

    Seminar
    15:00 to 16:00

    Interactive proofs and algorithmic epistemology
    Bernard Chazelle

    Lecture
    14:00 to 15:00

    Approximations
    Claire Mathieu

    Seminar
    15:00 to 16:00

    The complexity of communication
    Bernard Chazelle

    Lecture
    14:00 to 15:00

    Computational Insights and the Theory of Evolution
    Christos Papadimitriou

    Seminar
    15:00 to 16:00

    Algorithmic game theory
    Bernard Chazelle

    Lecture
    14:00 to 15:00

    Quantifying the Inefficiency of Game-Theoretic Equilibria
    Tim Roughgarden

    Seminar
    15:00 to 16:00

    Learning and self-improving algorithms
    Bernard Chazelle

    Lecture
    14:00 to 15:00

    Optimization and Learning
    Alexandre d'Aspremont

    Seminar
    15:00 to 16:00

    Algorithms for emerging phenomena
    Bernard Chazelle

    Lecture
    14:00 to 15:00

    Persistent Homology Applied
    Herbert Edelsbrunner

    Seminar
    15:00 to 16:00

    Systems of influence and social dynamics
    Bernard Chazelle

    Lecture
    14:00 to 15:00

    Physarum Computations
    Kurt Mehlhorn

    Seminar
    15:00 to 16:00

    Natural algorithms and science
    Bernard Chazelle

    Lecture
    14:00 to 15:00

    Probabilistic analysis of peer-to-peer networks
    François Baccelli

    Seminar
    15:00 to 16:00

    See also

    Lecture related to the seminar: Algorithms and science
    Bernard Chazelle, chair Computer Sciences and Digital Technologies
    Algorithms and science