having a nonempty core, and this core is usually considered as the solution of game. Based on the concept of k-additivity, we … define to so-called k-balanced games and the corresponding generalization of core, the k-additive core, whose elements are … corresponding k-additive core is not empty. For the games in the k-additive core, we propose a sharing procedure to get an …

general conditions. They imply that any efficient profile that is approximately achievable must be in the core of the …) an efficient profile can be approximately achieved if and only if it is in the core; and (iii) any achievable profile can …

general conditions. They imply that any efficient profile that is approximately achievable must be in the core of the …) an efficient profile can be approximately achieved if and only if it is in the core; and (iii) any achievable profile can …

outside players play their best response noncooperatively, the core is always nonempty when the game has strategic …

We introduce the framework of parameterized collections of games and provide three nonemptiness of approximate core …

required size of epsilon for non-emptiness of the epsilon-core, the parameters describing the collection of games, and the size …