IDEAS home Printed from https://ideas.repec.org/p/amz/wpaper/2026-22.html

Homogenization and Mean-Field Approximation for Multi-Player Games

Author

Listed:
  • Cont, Rama

    (Mathematical Institute, University of Oxford)

  • Hu, Anran

    (IEOR Department, Columbia University, New York)

Abstract

We investigate how the framework of mean-field games may be used to study strategic interactions in large heterogeneous populations. Starting from a partition of the player population into groups, we introduce an intermediate finite-player game of mean-field type and derive explicit non asymptotic bounds for the average exploitability of strategy profiles obtained by lifting strategies from the associated multi-population mean-field game. The approximation error decomposes into two components: a finite population mean-field error, controlled by empirical-measure approximation within each group, and a heterogeneity error measuring deviations of the original players' rewards and transition dynamics from their group-level approximations. Our results apply to compact state and action spaces and allow heterogeneous deterministic initial states within each population. We further study the resulting tradeoff between group size and intra-group heterogeneity. In a parametrized heterogeneous setting, the choice of partition minimizing the resulting certified upper bound can be formulated as a mixed-integer second-order cone program. In the large-population regime, this problem is shown to be related to K-means clustering.

Suggested Citation

  • Cont, Rama & Hu, Anran, 2026. "Homogenization and Mean-Field Approximation for Multi-Player Games," INET Oxford Working Papers 2026-22, Institute for New Economic Thinking at the Oxford Martin School, University of Oxford.
  • Handle: RePEc:amz:wpaper:2026-22
    as

    Download full text from publisher

    File URL: https://oms-inet.files.svdcdn.com/production/files/Homogenization_And_Mean_Field_Approximation_For_Multi_Player_Games_WP_Aug_26.pdf?dm=1788360255
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:amz:wpaper:2026-22. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: INET Oxford admin team (email available below). General contact details of provider: https://edirc.repec.org/data/inoxfuk.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.