15:00 to 16:00
Seminar

Quantifying the Inefficiency of Game-Theoretic Equilibria

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

    Speaker(s)

    Tim Roughgarden

    Stanford University

    Events

    Lecture
    14:00 to 15:00
    Bernard Chazelle

    The complexity of hazards
    Seminar
    15:00 to 16:00
    Jacques Stern

    Risk and Complexity in Cryptography
    Lecture
    14:00 to 15:00
    Bernard Chazelle

    Interactive proofs and algorithmic epistemology
    Seminar
    15:00 to 16:00
    Claire Mathieu

    Approximations
    Lecture
    14:00 to 15:00
    Bernard Chazelle

    The complexity of communication
    Seminar
    15:00 to 16:00
    Christos Papadimitriou

    Computational Insights and the Theory of Evolution
    Lecture
    14:00 to 15:00
    Bernard Chazelle

    Algorithmic game theory
    Seminar
    15:00 to 16:00
    Tim Roughgarden

    Quantifying the Inefficiency of Game-Theoretic Equilibria
    Lecture
    14:00 to 15:00
    Bernard Chazelle

    Learning and self-improving algorithms
    Seminar
    15:00 to 16:00
    Alexandre d'Aspremont

    Optimization and Learning
    Lecture
    14:00 to 15:00
    Bernard Chazelle

    Algorithms for emerging phenomena
    Seminar
    15:00 to 16:00
    Herbert Edelsbrunner

    Persistent Homology Applied
    Lecture
    14:00 to 15:00
    Bernard Chazelle

    Systems of influence and social dynamics
    Seminar
    15:00 to 16:00
    Kurt Mehlhorn

    Physarum Computations
    Lecture
    14:00 to 15:00
    Bernard Chazelle

    Natural algorithms and science
    Seminar
    15:00 to 16:00
    François Baccelli

    Probabilistic analysis of peer-to-peer networks

    See also

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