k-degree-of-freedom uncertain Ellsberg urn problem
Abstract The Ellsberg uncertain urn problem approaches to determine the probability of drawing a ball of a particular color from an urn that contains n balls of few different colors. The uncertainty comes from the fact that the number of balls of each color is not known beforehand. Liu et al. studie...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Bhattacharya, Arghya [verfasserIn] |
|---|
| Format: |
E-Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2023 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2023. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law. |
|---|
| Übergeordnetes Werk: |
Enthalten in: Soft Computing - Springer-Verlag, 2003, 27(2023), 11 vom: 17. Feb., Seite 7033-7038 |
|---|---|
| Übergeordnetes Werk: |
volume:27 ; year:2023 ; number:11 ; day:17 ; month:02 ; pages:7033-7038 |
| Links: |
|---|
| DOI / URN: |
10.1007/s00500-023-07893-8 |
|---|
| Katalog-ID: |
SPR052397254 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | SPR052397254 | ||
| 003 | DE-627 | ||
| 005 | 20240827161824.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 230726s2023 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s00500-023-07893-8 |2 doi | |
| 035 | |a (DE-627)SPR052397254 | ||
| 035 | |a (SPR)s00500-023-07893-8-e | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 100 | 1 | |a Bhattacharya, Arghya |e verfasserin |0 (orcid)0000-0002-0557-4340 |4 aut | |
| 245 | 1 | 0 | |a k-degree-of-freedom uncertain Ellsberg urn problem |
| 264 | 1 | |c 2023 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a Computermedien |b c |2 rdamedia | ||
| 338 | |a Online-Ressource |b cr |2 rdacarrier | ||
| 500 | |a © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2023. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law. | ||
| 520 | |a Abstract The Ellsberg uncertain urn problem approaches to determine the probability of drawing a ball of a particular color from an urn that contains n balls of few different colors. The uncertainty comes from the fact that the number of balls of each color is not known beforehand. Liu et al. studied the problem in the light of the recently developed uncertainty theory. They considered a single-degree-of-freedom of uncertainty in the urn, i.e., the problem deals with uncertainty stemming from the fact that the number of balls for two colors is unknown, but the total number of balls is known. We further generalize the problem by proposing a k-degree-of-freedom Ellsberg urn problem. In this setting of the problem, the Ellsberg urn contains a total of n balls, and each ball is either one of the %$k+1%$ colors. The numbers of balls of different colors are unknown and come from an unknown distribution. The number of balls of different colors is considered an uncertain variable. We propose a mathematical formulation of the complex system with randomness and uncertainty when a ball is randomly picked from the urn. | ||
| 650 | 4 | |a Ellsberg urn |7 (dpeaa)DE-He213 | |
| 650 | 4 | |a Uncertainty theory |7 (dpeaa)DE-He213 | |
| 650 | 4 | |a Chance theory |7 (dpeaa)DE-He213 | |
| 773 | 0 | 8 | |i Enthalten in |t Soft Computing |d Springer-Verlag, 2003 |g 27(2023), 11 vom: 17. Feb., Seite 7033-7038 |w (DE-627)SPR006469531 |7 nnns |
| 773 | 1 | 8 | |g volume:27 |g year:2023 |g number:11 |g day:17 |g month:02 |g pages:7033-7038 |
| 856 | 4 | 0 | |u https://dx.doi.org/10.1007/s00500-023-07893-8 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_SPRINGER | ||
| 951 | |a AR | ||
| 952 | |d 27 |j 2023 |e 11 |b 17 |c 02 |h 7033-7038 | ||
| author_variant |
a b ab |
|---|---|
| matchkey_str |
bhattacharyaarghya:2023----:dgeofedmnetielb |
| hierarchy_sort_str |
2023 |
| publishDate |
2023 |
| allfields |
10.1007/s00500-023-07893-8 doi (DE-627)SPR052397254 (SPR)s00500-023-07893-8-e DE-627 ger DE-627 rakwb eng Bhattacharya, Arghya verfasserin (orcid)0000-0002-0557-4340 aut k-degree-of-freedom uncertain Ellsberg urn problem 2023 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2023. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law. Abstract The Ellsberg uncertain urn problem approaches to determine the probability of drawing a ball of a particular color from an urn that contains n balls of few different colors. The uncertainty comes from the fact that the number of balls of each color is not known beforehand. Liu et al. studied the problem in the light of the recently developed uncertainty theory. They considered a single-degree-of-freedom of uncertainty in the urn, i.e., the problem deals with uncertainty stemming from the fact that the number of balls for two colors is unknown, but the total number of balls is known. We further generalize the problem by proposing a k-degree-of-freedom Ellsberg urn problem. In this setting of the problem, the Ellsberg urn contains a total of n balls, and each ball is either one of the %$k+1%$ colors. The numbers of balls of different colors are unknown and come from an unknown distribution. The number of balls of different colors is considered an uncertain variable. We propose a mathematical formulation of the complex system with randomness and uncertainty when a ball is randomly picked from the urn. Ellsberg urn (dpeaa)DE-He213 Uncertainty theory (dpeaa)DE-He213 Chance theory (dpeaa)DE-He213 Enthalten in Soft Computing Springer-Verlag, 2003 27(2023), 11 vom: 17. Feb., Seite 7033-7038 (DE-627)SPR006469531 nnns volume:27 year:2023 number:11 day:17 month:02 pages:7033-7038 https://dx.doi.org/10.1007/s00500-023-07893-8 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER AR 27 2023 11 17 02 7033-7038 |
| spelling |
10.1007/s00500-023-07893-8 doi (DE-627)SPR052397254 (SPR)s00500-023-07893-8-e DE-627 ger DE-627 rakwb eng Bhattacharya, Arghya verfasserin (orcid)0000-0002-0557-4340 aut k-degree-of-freedom uncertain Ellsberg urn problem 2023 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2023. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law. Abstract The Ellsberg uncertain urn problem approaches to determine the probability of drawing a ball of a particular color from an urn that contains n balls of few different colors. The uncertainty comes from the fact that the number of balls of each color is not known beforehand. Liu et al. studied the problem in the light of the recently developed uncertainty theory. They considered a single-degree-of-freedom of uncertainty in the urn, i.e., the problem deals with uncertainty stemming from the fact that the number of balls for two colors is unknown, but the total number of balls is known. We further generalize the problem by proposing a k-degree-of-freedom Ellsberg urn problem. In this setting of the problem, the Ellsberg urn contains a total of n balls, and each ball is either one of the %$k+1%$ colors. The numbers of balls of different colors are unknown and come from an unknown distribution. The number of balls of different colors is considered an uncertain variable. We propose a mathematical formulation of the complex system with randomness and uncertainty when a ball is randomly picked from the urn. Ellsberg urn (dpeaa)DE-He213 Uncertainty theory (dpeaa)DE-He213 Chance theory (dpeaa)DE-He213 Enthalten in Soft Computing Springer-Verlag, 2003 27(2023), 11 vom: 17. Feb., Seite 7033-7038 (DE-627)SPR006469531 nnns volume:27 year:2023 number:11 day:17 month:02 pages:7033-7038 https://dx.doi.org/10.1007/s00500-023-07893-8 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER AR 27 2023 11 17 02 7033-7038 |
| allfields_unstemmed |
10.1007/s00500-023-07893-8 doi (DE-627)SPR052397254 (SPR)s00500-023-07893-8-e DE-627 ger DE-627 rakwb eng Bhattacharya, Arghya verfasserin (orcid)0000-0002-0557-4340 aut k-degree-of-freedom uncertain Ellsberg urn problem 2023 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2023. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law. Abstract The Ellsberg uncertain urn problem approaches to determine the probability of drawing a ball of a particular color from an urn that contains n balls of few different colors. The uncertainty comes from the fact that the number of balls of each color is not known beforehand. Liu et al. studied the problem in the light of the recently developed uncertainty theory. They considered a single-degree-of-freedom of uncertainty in the urn, i.e., the problem deals with uncertainty stemming from the fact that the number of balls for two colors is unknown, but the total number of balls is known. We further generalize the problem by proposing a k-degree-of-freedom Ellsberg urn problem. In this setting of the problem, the Ellsberg urn contains a total of n balls, and each ball is either one of the %$k+1%$ colors. The numbers of balls of different colors are unknown and come from an unknown distribution. The number of balls of different colors is considered an uncertain variable. We propose a mathematical formulation of the complex system with randomness and uncertainty when a ball is randomly picked from the urn. Ellsberg urn (dpeaa)DE-He213 Uncertainty theory (dpeaa)DE-He213 Chance theory (dpeaa)DE-He213 Enthalten in Soft Computing Springer-Verlag, 2003 27(2023), 11 vom: 17. Feb., Seite 7033-7038 (DE-627)SPR006469531 nnns volume:27 year:2023 number:11 day:17 month:02 pages:7033-7038 https://dx.doi.org/10.1007/s00500-023-07893-8 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER AR 27 2023 11 17 02 7033-7038 |
| allfieldsGer |
10.1007/s00500-023-07893-8 doi (DE-627)SPR052397254 (SPR)s00500-023-07893-8-e DE-627 ger DE-627 rakwb eng Bhattacharya, Arghya verfasserin (orcid)0000-0002-0557-4340 aut k-degree-of-freedom uncertain Ellsberg urn problem 2023 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2023. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law. Abstract The Ellsberg uncertain urn problem approaches to determine the probability of drawing a ball of a particular color from an urn that contains n balls of few different colors. The uncertainty comes from the fact that the number of balls of each color is not known beforehand. Liu et al. studied the problem in the light of the recently developed uncertainty theory. They considered a single-degree-of-freedom of uncertainty in the urn, i.e., the problem deals with uncertainty stemming from the fact that the number of balls for two colors is unknown, but the total number of balls is known. We further generalize the problem by proposing a k-degree-of-freedom Ellsberg urn problem. In this setting of the problem, the Ellsberg urn contains a total of n balls, and each ball is either one of the %$k+1%$ colors. The numbers of balls of different colors are unknown and come from an unknown distribution. The number of balls of different colors is considered an uncertain variable. We propose a mathematical formulation of the complex system with randomness and uncertainty when a ball is randomly picked from the urn. Ellsberg urn (dpeaa)DE-He213 Uncertainty theory (dpeaa)DE-He213 Chance theory (dpeaa)DE-He213 Enthalten in Soft Computing Springer-Verlag, 2003 27(2023), 11 vom: 17. Feb., Seite 7033-7038 (DE-627)SPR006469531 nnns volume:27 year:2023 number:11 day:17 month:02 pages:7033-7038 https://dx.doi.org/10.1007/s00500-023-07893-8 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER AR 27 2023 11 17 02 7033-7038 |
| allfieldsSound |
10.1007/s00500-023-07893-8 doi (DE-627)SPR052397254 (SPR)s00500-023-07893-8-e DE-627 ger DE-627 rakwb eng Bhattacharya, Arghya verfasserin (orcid)0000-0002-0557-4340 aut k-degree-of-freedom uncertain Ellsberg urn problem 2023 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2023. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law. Abstract The Ellsberg uncertain urn problem approaches to determine the probability of drawing a ball of a particular color from an urn that contains n balls of few different colors. The uncertainty comes from the fact that the number of balls of each color is not known beforehand. Liu et al. studied the problem in the light of the recently developed uncertainty theory. They considered a single-degree-of-freedom of uncertainty in the urn, i.e., the problem deals with uncertainty stemming from the fact that the number of balls for two colors is unknown, but the total number of balls is known. We further generalize the problem by proposing a k-degree-of-freedom Ellsberg urn problem. In this setting of the problem, the Ellsberg urn contains a total of n balls, and each ball is either one of the %$k+1%$ colors. The numbers of balls of different colors are unknown and come from an unknown distribution. The number of balls of different colors is considered an uncertain variable. We propose a mathematical formulation of the complex system with randomness and uncertainty when a ball is randomly picked from the urn. Ellsberg urn (dpeaa)DE-He213 Uncertainty theory (dpeaa)DE-He213 Chance theory (dpeaa)DE-He213 Enthalten in Soft Computing Springer-Verlag, 2003 27(2023), 11 vom: 17. Feb., Seite 7033-7038 (DE-627)SPR006469531 nnns volume:27 year:2023 number:11 day:17 month:02 pages:7033-7038 https://dx.doi.org/10.1007/s00500-023-07893-8 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER AR 27 2023 11 17 02 7033-7038 |
| language |
English |
| source |
Enthalten in Soft Computing 27(2023), 11 vom: 17. Feb., Seite 7033-7038 volume:27 year:2023 number:11 day:17 month:02 pages:7033-7038 |
| sourceStr |
Enthalten in Soft Computing 27(2023), 11 vom: 17. Feb., Seite 7033-7038 volume:27 year:2023 number:11 day:17 month:02 pages:7033-7038 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Ellsberg urn Uncertainty theory Chance theory |
| isfreeaccess_bool |
false |
| container_title |
Soft Computing |
| authorswithroles_txt_mv |
Bhattacharya, Arghya @@aut@@ |
| publishDateDaySort_date |
2023-02-17T00:00:00Z |
| hierarchy_top_id |
SPR006469531 |
| id |
SPR052397254 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">SPR052397254</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20240827161824.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230726s2023 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s00500-023-07893-8</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)SPR052397254</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(SPR)s00500-023-07893-8-e</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Bhattacharya, Arghya</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(orcid)0000-0002-0557-4340</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">k-degree-of-freedom uncertain Ellsberg urn problem</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2023</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2023. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract The Ellsberg uncertain urn problem approaches to determine the probability of drawing a ball of a particular color from an urn that contains n balls of few different colors. The uncertainty comes from the fact that the number of balls of each color is not known beforehand. Liu et al. studied the problem in the light of the recently developed uncertainty theory. They considered a single-degree-of-freedom of uncertainty in the urn, i.e., the problem deals with uncertainty stemming from the fact that the number of balls for two colors is unknown, but the total number of balls is known. We further generalize the problem by proposing a k-degree-of-freedom Ellsberg urn problem. In this setting of the problem, the Ellsberg urn contains a total of n balls, and each ball is either one of the %$k+1%$ colors. The numbers of balls of different colors are unknown and come from an unknown distribution. The number of balls of different colors is considered an uncertain variable. We propose a mathematical formulation of the complex system with randomness and uncertainty when a ball is randomly picked from the urn.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Ellsberg urn</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Uncertainty theory</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Chance theory</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Soft Computing</subfield><subfield code="d">Springer-Verlag, 2003</subfield><subfield code="g">27(2023), 11 vom: 17. Feb., Seite 7033-7038</subfield><subfield code="w">(DE-627)SPR006469531</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:27</subfield><subfield code="g">year:2023</subfield><subfield code="g">number:11</subfield><subfield code="g">day:17</subfield><subfield code="g">month:02</subfield><subfield code="g">pages:7033-7038</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://dx.doi.org/10.1007/s00500-023-07893-8</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_SPRINGER</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">27</subfield><subfield code="j">2023</subfield><subfield code="e">11</subfield><subfield code="b">17</subfield><subfield code="c">02</subfield><subfield code="h">7033-7038</subfield></datafield></record></collection>
|
| author |
Bhattacharya, Arghya |
| spellingShingle |
Bhattacharya, Arghya misc Ellsberg urn misc Uncertainty theory misc Chance theory k-degree-of-freedom uncertain Ellsberg urn problem |
| authorStr |
Bhattacharya, Arghya |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)SPR006469531 |
| format |
electronic Article |
| delete_txt_mv |
keep |
| author_role |
aut |
| collection |
springer |
| remote_str |
true |
| illustrated |
Not Illustrated |
| topic_title |
k-degree-of-freedom uncertain Ellsberg urn problem Ellsberg urn (dpeaa)DE-He213 Uncertainty theory (dpeaa)DE-He213 Chance theory (dpeaa)DE-He213 |
| topic |
misc Ellsberg urn misc Uncertainty theory misc Chance theory |
| topic_unstemmed |
misc Ellsberg urn misc Uncertainty theory misc Chance theory |
| topic_browse |
misc Ellsberg urn misc Uncertainty theory misc Chance theory |
| format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
cr |
| hierarchy_parent_title |
Soft Computing |
| hierarchy_parent_id |
SPR006469531 |
| hierarchy_top_title |
Soft Computing |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)SPR006469531 |
| title |
k-degree-of-freedom uncertain Ellsberg urn problem |
| ctrlnum |
(DE-627)SPR052397254 (SPR)s00500-023-07893-8-e |
| title_full |
k-degree-of-freedom uncertain Ellsberg urn problem |
| author_sort |
Bhattacharya, Arghya |
| journal |
Soft Computing |
| journalStr |
Soft Computing |
| lang_code |
eng |
| isOA_bool |
false |
| recordtype |
marc |
| publishDateSort |
2023 |
| contenttype_str_mv |
txt |
| container_start_page |
7033 |
| author_browse |
Bhattacharya, Arghya |
| container_volume |
27 |
| format_se |
Elektronische Aufsätze |
| author-letter |
Bhattacharya, Arghya |
| doi_str_mv |
10.1007/s00500-023-07893-8 |
| normlink |
(ORCID)0000-0002-0557-4340 |
| normlink_prefix_str_mv |
(orcid)0000-0002-0557-4340 |
| title_sort |
k-degree-of-freedom uncertain ellsberg urn problem |
| title_auth |
k-degree-of-freedom uncertain Ellsberg urn problem |
| abstract |
Abstract The Ellsberg uncertain urn problem approaches to determine the probability of drawing a ball of a particular color from an urn that contains n balls of few different colors. The uncertainty comes from the fact that the number of balls of each color is not known beforehand. Liu et al. studied the problem in the light of the recently developed uncertainty theory. They considered a single-degree-of-freedom of uncertainty in the urn, i.e., the problem deals with uncertainty stemming from the fact that the number of balls for two colors is unknown, but the total number of balls is known. We further generalize the problem by proposing a k-degree-of-freedom Ellsberg urn problem. In this setting of the problem, the Ellsberg urn contains a total of n balls, and each ball is either one of the %$k+1%$ colors. The numbers of balls of different colors are unknown and come from an unknown distribution. The number of balls of different colors is considered an uncertain variable. We propose a mathematical formulation of the complex system with randomness and uncertainty when a ball is randomly picked from the urn. © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2023. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law. |
| abstractGer |
Abstract The Ellsberg uncertain urn problem approaches to determine the probability of drawing a ball of a particular color from an urn that contains n balls of few different colors. The uncertainty comes from the fact that the number of balls of each color is not known beforehand. Liu et al. studied the problem in the light of the recently developed uncertainty theory. They considered a single-degree-of-freedom of uncertainty in the urn, i.e., the problem deals with uncertainty stemming from the fact that the number of balls for two colors is unknown, but the total number of balls is known. We further generalize the problem by proposing a k-degree-of-freedom Ellsberg urn problem. In this setting of the problem, the Ellsberg urn contains a total of n balls, and each ball is either one of the %$k+1%$ colors. The numbers of balls of different colors are unknown and come from an unknown distribution. The number of balls of different colors is considered an uncertain variable. We propose a mathematical formulation of the complex system with randomness and uncertainty when a ball is randomly picked from the urn. © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2023. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law. |
| abstract_unstemmed |
Abstract The Ellsberg uncertain urn problem approaches to determine the probability of drawing a ball of a particular color from an urn that contains n balls of few different colors. The uncertainty comes from the fact that the number of balls of each color is not known beforehand. Liu et al. studied the problem in the light of the recently developed uncertainty theory. They considered a single-degree-of-freedom of uncertainty in the urn, i.e., the problem deals with uncertainty stemming from the fact that the number of balls for two colors is unknown, but the total number of balls is known. We further generalize the problem by proposing a k-degree-of-freedom Ellsberg urn problem. In this setting of the problem, the Ellsberg urn contains a total of n balls, and each ball is either one of the %$k+1%$ colors. The numbers of balls of different colors are unknown and come from an unknown distribution. The number of balls of different colors is considered an uncertain variable. We propose a mathematical formulation of the complex system with randomness and uncertainty when a ball is randomly picked from the urn. © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2023. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law. |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER |
| container_issue |
11 |
| title_short |
k-degree-of-freedom uncertain Ellsberg urn problem |
| url |
https://dx.doi.org/10.1007/s00500-023-07893-8 |
| remote_bool |
true |
| ppnlink |
SPR006469531 |
| mediatype_str_mv |
c |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s00500-023-07893-8 |
| up_date |
2024-08-28T05:54:43.504Z |
| _version_ |
1808609557615738880 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">SPR052397254</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20240827161824.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230726s2023 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s00500-023-07893-8</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)SPR052397254</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(SPR)s00500-023-07893-8-e</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Bhattacharya, Arghya</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(orcid)0000-0002-0557-4340</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">k-degree-of-freedom uncertain Ellsberg urn problem</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2023</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2023. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract The Ellsberg uncertain urn problem approaches to determine the probability of drawing a ball of a particular color from an urn that contains n balls of few different colors. The uncertainty comes from the fact that the number of balls of each color is not known beforehand. Liu et al. studied the problem in the light of the recently developed uncertainty theory. They considered a single-degree-of-freedom of uncertainty in the urn, i.e., the problem deals with uncertainty stemming from the fact that the number of balls for two colors is unknown, but the total number of balls is known. We further generalize the problem by proposing a k-degree-of-freedom Ellsberg urn problem. In this setting of the problem, the Ellsberg urn contains a total of n balls, and each ball is either one of the %$k+1%$ colors. The numbers of balls of different colors are unknown and come from an unknown distribution. The number of balls of different colors is considered an uncertain variable. We propose a mathematical formulation of the complex system with randomness and uncertainty when a ball is randomly picked from the urn.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Ellsberg urn</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Uncertainty theory</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Chance theory</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Soft Computing</subfield><subfield code="d">Springer-Verlag, 2003</subfield><subfield code="g">27(2023), 11 vom: 17. Feb., Seite 7033-7038</subfield><subfield code="w">(DE-627)SPR006469531</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:27</subfield><subfield code="g">year:2023</subfield><subfield code="g">number:11</subfield><subfield code="g">day:17</subfield><subfield code="g">month:02</subfield><subfield code="g">pages:7033-7038</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://dx.doi.org/10.1007/s00500-023-07893-8</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_SPRINGER</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">27</subfield><subfield code="j">2023</subfield><subfield code="e">11</subfield><subfield code="b">17</subfield><subfield code="c">02</subfield><subfield code="h">7033-7038</subfield></datafield></record></collection>
|
| score |
7.169118 |