Ellsberg urn problems with multiple degrees of freedom

被引:2
|
作者
Ye, Tingqing [1 ]
Ralescu, Dan A. [2 ]
Jia, Lifen [3 ]
机构
[1] Tsinghua Univ, Dept Math Sci, Beijing, Peoples R China
[2] Univ Cincinnati, Dept Math Sci, Cincinnati, OH USA
[3] Capital Univ Econ & Business, Sch Management & Engn, Beijing 100070, Peoples R China
基金
中国国家自然科学基金;
关键词
Ellsberg urn; uncertainty theory; chance theory; chance measure;
D O I
10.3233/JIFS-190761
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
An Ellsberg urn is filled with n balls of m different colors and each ball is marked in only one color. However, the number of balls of each color is unknown, which should be regarded as uncertain variable. Moreover, since we randomly draw a ball from the urn, Ellsberg urn problems are a mixture of uncertainty and randomness. In order to deal with such problems, we can employ probability theory, uncertainty theory, and chance theory. Until now only the case m = 3 has been studied. This paper is aimed at studying more general cases where m > 3. It is concluded that the chance of drawing a ball of one color is equal to that of drawing a ball of another color.
引用
收藏
页码:8267 / 8273
页数:7
相关论文
共 50 条
  • [1] Uncertain Urn Problems and Ellsberg Experiment
    Baoding Liu
    [J]. Soft Computing, 2019, 23 : 6579 - 6584
  • [2] Uncertain Urn Problems and Ellsberg Experiment
    Liu, Baoding
    [J]. SOFT COMPUTING, 2019, 23 (15) : 6579 - 6584
  • [3] Two-degree-of-freedom Ellsberg urn problem
    Waichon Lio
    Guangquan Cheng
    [J]. Soft Computing, 2020, 24 : 6903 - 6908
  • [4] Two-degree-of-freedom Ellsberg urn problem
    Lio, Waichon
    Cheng, Guangquan
    [J]. SOFT COMPUTING, 2020, 24 (09) : 6903 - 6908
  • [5] k-degree-of-freedom uncertain Ellsberg urn problem
    Arghya Bhattacharya
    [J]. Soft Computing, 2023, 27 : 7033 - 7038
  • [6] k-degree-of-freedom uncertain Ellsberg urn problem
    Bhattacharya, Arghya
    [J]. SOFT COMPUTING, 2023, 27 (11) : 7033 - 7038
  • [7] A dynamic Ellsberg urn experiment
    Dominiak, Adam
    Duersch, Peter
    Lefort, Jean-Philippe
    [J]. GAMES AND ECONOMIC BEHAVIOR, 2012, 75 (02) : 625 - 638
  • [8] Ellsberg meets Keynes at an urn
    Chew, Soo Hong
    Miao, Bin
    Zhong, Songfa
    [J]. QUANTITATIVE ECONOMICS, 2023, 14 (03) : 1133 - 1162
  • [9] Event-Separability in the Ellsberg urn
    Machina, Mark J.
    [J]. ECONOMIC THEORY, 2011, 48 (2-3) : 425 - 436
  • [10] Event-Separability in the Ellsberg urn
    Mark J. Machina
    [J]. Economic Theory, 2011, 48 : 425 - 436