3:00 - 4:00pm
Seminar

Quantifying the Inefficiency of Game-Theoretic Equilibria

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

    Speaker(s)

    Tim Roughgarden

    Stanford University

    Events

    The complexity of hazards
    Bernard Chazelle

    Lecture
    2:00 - 3:00pm

    Risk and Complexity in Cryptography
    Jacques Stern

    Seminar
    3:00 - 4:00pm

    Interactive proofs and algorithmic epistemology
    Bernard Chazelle

    Lecture
    2:00 - 3:00pm

    Approximations
    Claire Mathieu

    Seminar
    3:00 - 4:00pm

    The complexity of communication
    Bernard Chazelle

    Lecture
    2:00 - 3:00pm

    Computational Insights and the Theory of Evolution
    Christos Papadimitriou

    Seminar
    3:00 - 4:00pm

    Algorithmic game theory
    Bernard Chazelle

    Lecture
    2:00 - 3:00pm

    Quantifying the Inefficiency of Game-Theoretic Equilibria
    Tim Roughgarden

    Seminar
    3:00 - 4:00pm

    Learning and self-improving algorithms
    Bernard Chazelle

    Lecture
    2:00 - 3:00pm

    Optimization and Learning
    Alexandre d'Aspremont

    Seminar
    3:00 - 4:00pm

    Algorithms for emerging phenomena
    Bernard Chazelle

    Lecture
    2:00 - 3:00pm

    Persistent Homology Applied
    Herbert Edelsbrunner

    Seminar
    3:00 - 4:00pm

    Systems of influence and social dynamics
    Bernard Chazelle

    Lecture
    2:00 - 3:00pm

    Physarum Computations
    Kurt Mehlhorn

    Seminar
    3:00 - 4:00pm

    Natural algorithms and science
    Bernard Chazelle

    Lecture
    2:00 - 3:00pm

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

    Seminar
    3:00 - 4:00pm

    See also

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