On the estimation of the core for TU games

被引:1
作者
Saavedra-Nieves, Alejandro [1 ]
Saavedra-Nieves, Paula [1 ]
机构
[1] Univ Santiago Compostela, CITMAga, MODESTYA Res Grp, Rua Lope Gomez Marzoa,s-n, Santiago De Compostela 15782, Spain
关键词
Game theory; Core estimator; Set estimation; Convex hull; Core-center estimator; HIT-AND-RUN; SEQUENCING SITUATIONS; PROFIT ALLOCATION; CONVEX HULLS; ALGORITHM; POINTS; COOPERATION; SHAPLEY; SETS;
D O I
10.1016/j.eswa.2023.123132
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The core of a transferable utility (TU) game, if it is not empty, is prescribed by the set of all stable allocations. The exact determination of the core reaches exponential time complexity. Therefore, its exact computation is often avoided as the number of players increases. In this work, we propose an estimator for the core of a TU game based on the statistical theory of set estimation. Concretely, we provide a core reconstruction that is obtained in polynomial time for general dimension. Additionally, convergence rates for the estimation error are derived. Finally, a consistent core -center estimator is established as a geometrical application of this methodology.
引用
收藏
页数:15
相关论文
共 71 条
[1]   Horizontal cooperation in a multimodal public transport system: The profit allocation problem [J].
Algaba, Encarnacion ;
Fragnelli, Vito ;
Llorca, Natividad ;
Sanchez-Soriano, Joaquin .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2019, 275 (02) :659-665
[2]  
[Anonymous], 1963, Problemy Kybernetiki
[3]  
Aumann R. J., 1974, International Journal of Game Theory, V3, P217, DOI 10.1007/BF01766876
[4]   A PIVOTING ALGORITHM FOR CONVEX HULLS AND VERTEX ENUMERATION OF ARRANGEMENTS AND POLYHEDRA [J].
AVIS, D ;
FUKUDA, K .
DISCRETE & COMPUTATIONAL GEOMETRY, 1992, 8 (03) :295-313
[5]   Approximating power indices: theoretical and empirical analysis [J].
Bachrach, Yoram ;
Markakis, Evangelos ;
Resnick, Ezra ;
Procaccia, Ariel D. ;
Rosenschein, Jeffrey S. ;
Saberi, Amin .
AUTONOMOUS AGENTS AND MULTI-AGENT SYSTEMS, 2010, 20 (02) :105-122
[6]   A stochastic approach to approximate values in cooperative games [J].
Benati, Stefano ;
Lopez-Blazquez, Fernando ;
Puerto, Justo .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2019, 279 (01) :93-106
[7]   Polynomial calculation of the Shapley value based on sampling [J].
Castro, Javier ;
Gomez, Daniel ;
Tejada, Juan .
COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (05) :1726-1730
[8]   AN OPTIMAL CONVEX-HULL ALGORITHM IN ANY FIXED DIMENSION [J].
CHAZELLE, B .
DISCRETE & COMPUTATIONAL GEOMETRY, 1993, 10 (04) :377-409
[9]  
Cuevas A., 2010, New Perspectives in Stochastic Geometry, P374
[10]  
Derks J., 2002, Chapters in game theory. Theory and decision library C, V31, P83