p-additive games: a class of totally balanced games arising from inventory situations with temporary discounts
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911772573696000 |
|---|---|
| author | Meca, Ana Guardiola, Luis A. Toledo, Andrés |
| author_facet | Meca, Ana Guardiola, Luis A. Toledo, Andrés |
| contents | We introduce a new class of totally balanced cooperative TU games, namely p -additive games. It is inspired by the class of inventory games that arises from inventory situations with temporary discounts (Toledo, 2002) and contains the class of inventory cost games (Meca et al. 2003). It is shown that every p-additive game and its corresponding subgames have a nonempty core. We also focus on studying the character concave or convex and monotone of p-additive games. In addition, the modified SOC-rule is proposed as a solution for p-additive games. This solution is suitable for p-additive games since it is a core-allocation which can be reached through a population monotonic allocation scheme. Moreover, two characterizations of the modified SOC-rule are provided. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_04336 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | p-additive games: a class of totally balanced games arising from inventory situations with temporary discounts Meca, Ana Guardiola, Luis A. Toledo, Andrés Computer Science and Game Theory We introduce a new class of totally balanced cooperative TU games, namely p -additive games. It is inspired by the class of inventory games that arises from inventory situations with temporary discounts (Toledo, 2002) and contains the class of inventory cost games (Meca et al. 2003). It is shown that every p-additive game and its corresponding subgames have a nonempty core. We also focus on studying the character concave or convex and monotone of p-additive games. In addition, the modified SOC-rule is proposed as a solution for p-additive games. This solution is suitable for p-additive games since it is a core-allocation which can be reached through a population monotonic allocation scheme. Moreover, two characterizations of the modified SOC-rule are provided. |
| title | p-additive games: a class of totally balanced games arising from inventory situations with temporary discounts |
| topic | Computer Science and Game Theory |
| url | https://arxiv.org/abs/2402.04336 |