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...

We investigate cost-sharing mechanisms for scheduling cost-sharing games. We assume that the demand is general—that is, each player can be allocated one of several levels of service. We show how to design mechanisms for these games that are weakly group strategyproof, approximately...

This paper introduces an extension of the vehicle routing problem by including several distributors in competition. Each customer is characterized by demand and a wholesale price. Under this scenario a solution may have unserviced customers and elementary routes with no customer visits. The...