Bounded Approximate Payoff Division for MC-nets Games

Autor:	Hirayama, Katsutoshi, Okimoto, Tenda
Rok vydání:	2022
Předmět:	MC-nets Artificial Intelligence Hardware and Architecture constraint generation Computer Vision and Pattern Recognition Electrical and Electronic Engineering coalitional games ϵ-core Software
Zdroj:	IEICE Transactions on Information and Systems. :2085-2091
ISSN:	1745-1361 0916-8532
DOI:	10.1587/transinf.2022edp7039
Popis:	To the best of our knowledge, there have been very few work on computational algorithms for the core or its variants in MC-nets games. One exception is the work by [Hirayama, et.al., 2014], where a constraint generation algorithm has been proposed to compute a payoff vector belonging to the least core. In this paper, we generalize this algorithm into the one for finding a payoff vector belonging to ϵ-core with pre-specified bound guarantee. The underlying idea behind this algorithm is basically the same as the previous one, but one key contribution is to give a clearer view on the pricing problem leading to the development of our new general algorithm. We showed that this new algorithm was correct and never be trapped in an infinite loop. Furthermore, we empirically demonstrated that this algorithm really presented a trade-off between solution quality and computational costs on some benchmark instances.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::685e7393577cd61cb502ba1adfe73059 https://doi.org/10.1587/transinf.2022edp7039 Zobrazit plný text záznamu