We provide an abstract framework for submodular mean field games and identify verifiable sufficient conditions that allow to prove existence and approximation of strong mean field equilibria in models where data may not be continuous with respect to the measure parameter and common noise is...

An information-theoretic thought experiment is developed to clarify why the maximum entropy methodology is appropriate for predicting the equilibrium state of economic systems. As a first step, object allocation problems, modeled as knapsack problems, are shown to be equivalent to congestion...

We provide an abstract framework for submodular mean field games and identify verifiable sufficient conditions that allow to prove existence and approximation of strong mean field equilibria in models where data may not be continuous with respect to the measure parameter and common noise is...

How to allocate vaccines over heterogeneous individuals is one of the important policy decisions in pandemic times. This paper develops a procedure to estimate an individualized vaccine allocation policy under limited supply, exploiting social network data containing individual demographic...

How to allocate vaccines over heterogeneous individuals is one of the important policy decisions in pandemic times. This paper develops a procedure to estimate an individualized vaccine allocation policy under limited supply, exploiting social network data containing individual demographic...

This paper introduces cooperative games arising from multi-depot Chinese postman problems and explores the properties of these games. A multi-depot Chinese postman problem (MDCP) is represented by a connected (di)graph G, a set of k depots that is a subset of the vertices of G, and a...

Abstract A Chinese postman (CP) game is induced by a a weighted undirected, connected graph in which the edges are identified as players and a vertex is chosen as post-office location. Granot and Granot (2012) characterized graphs that give rise to CP games that are balanced. This note completes...

A connected graph G=(V,E), a vertex in V and a non-negative weight function defined on Ecan be used to induce Chinese postman and traveling salesman (cooperative) games. A graph G=(V,E) is said to be locally (respectively, globally) Chinese postman balanced (respectively, totally balanced,...