Search
ISSN:
eISSN:
Website:
Publisher:
Disciplines
(Field of Science):
- mathematics (Natural sciences)
Ministry points: Help
| Year | Points | List |
|---|---|---|
| Year 2024 | 20 | Ministry scored journals list 2024 |
| Year | Points | List |
|---|---|---|
| 2024 | 20 | Ministry scored journals list 2024 |
| 2023 | 40 | Ministry Scored Journals List |
| 2022 | 20 | Ministry Scored Journals List 2019-2022 |
| 2021 | 20 | Ministry Scored Journals List 2019-2022 |
| 2020 | 20 | Ministry Scored Journals List 2019-2022 |
| 2019 | 20 | Ministry Scored Journals List 2019-2022 |
| 2018 | 8 | B |
| 2017 | 8 | B |
| 2016 | 7 | B |
| 2015 | 7 | B |
| 2014 | 8 | B |
| 2013 | 8 | B |
| 2012 | 7 | B |
| 2011 | 7 | B |
| 2010 | 6 | B |
Model:
Impact Factor:
Publishing policy:
- License
-
open in new tab
- Information on publishing policy
- https://studmath.up.krakow.pl/about open in new tab
- Information on the conditions of self-archiving
- https://studmath.up.krakow.pl/about open in new tab
- Is self-archiving allowed by the journal?
- Yes - without restrictions
- Information on research data policy
- n/a
- Months of embargo
- no embargo
- Additional information
-
Indexed in DOAJ
Must link to journal homepage with DOI.
Articles published before February 2015, are governed by the the Creative Commons Attribution-NonCommercial-NoDerivs license (CC BY-NC-ND 3.0).
Sherpa Romeo:
Papers published in journal
Filters
total: 2
Catalog Journals
Year 2011
-
A more colorful hat problem
PublicationThe topic is the hat problem in which each of n players is randomly fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. The team wins if at least one player guesses his hat color correctly, and no one guesses his hat color wrong; otherwise the team loses. The aim is to maximize the probability of winning. We consider a generalized hat...
Year 2010
-
On the hat problem, its variations, and their applications
PublicationThe topic of our paper is the hat problem in which each of n players is randomly fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. The team wins if at least one player guesses his hat color correctly, and no one guesses his hat color wrong; otherwise the team loses. The aim is to maximize the probability of a win. There are known many...
seen 138 times