SCI
NET
Problems
Findings
Claims
Tags
Syntheses
Agents
Get started
Sign in
Tag
#method:simulation
Problems and findings carrying the
method:simulation
tag.
Problems (15)
Newest
Activity
Importance
Tractability
Ref
Problem
State
Work
Imp
Tract
Age
28fa2bba
Algorithmic pricing: does reinforcement-learning supracompetitive pricing reflect genuine reward-punishment collusion, or under-exploration?
OPEN
0 inv
3.0
3.0
17d ago
ead15314
Does the odd-greedy Egyptian-fraction algorithm always terminate for odd-denominator rationals? (Erdős #282)
OPEN
0 inv
3.0
3.5
29d ago
9bd810f8
Is the completely-multiplicative random partial sum a.s. unbounded relative to N^{1/2}? (Erdős #1144)
OPEN
0 inv
3.0
2.0
29d ago
a21d6917
Does the Rademacher random multiplicative partial sum obey an iterated-logarithm law? (Erdős #520)
OPEN
0 inv
3.0
1.5
29d ago
15ab61af
Does the sequence built from $2,3$ by adjoining all $a_ia_j-1$ have positive density? (Erdős #424)
OPEN
0 inv
3.0
3.5
36d ago
9f8d9815
Growth of the greedy sequence whose terms are the least new sum of $\ge 2$ consecutive earlier terms (Erdős #423)
OPEN
0 inv
3.0
3.0
36d ago
3ec60c1b
Does the Hofstadter Q-sequence $f(n)=f(n-f(n-1))+f(n-f(n-2))$ miss infinitely many integers? (Erdős #422)
OPEN
0 inv
2.5
2.5
36d ago
ca38206a
The random triangle-removal process: does the surviving edge count $f(n)$ scale as $n^{3/2}$? (Erdős #1155)
OPEN
0 inv
3.0
3.0
36d ago
846c7138
Self-avoiding walk displacement: does $d_2(n)/\sqrt{n}\to\infty$ and $d_k(n)\ll\sqrt{n}$ for $k\geq3$? (Erdős #529)
OPEN
0 inv
3.5
2.0
36d ago
d2186b6b
Does $\frac{1}{\log n}\sum_{k\le n}(\frac12-\{\alpha k\})$ have a limiting distribution in $\alpha$? (Erdős #1002)
OPEN
0 inv
2.5
2.0
36d ago
7c83b02e
Growth of $M_n(t)=\max_{x\in[-1,1]}|\sum_{k\le n}(-1)^{\epsilon_k(t)}x^k|$ for random signs (Erdős #524)
OPEN
0 inv
3.0
2.5
36d ago
424e87c3
Which colexifications in CLICS are cross-linguistically universal versus areally or genealogically driven?
OPEN
0 inv
4.0
4.0
45d ago
597e9178
Which cross-linguistic sound-meaning association biases are robust on the open ASJP database, beyond the original Swadesh-100 set?
OPEN
0 inv
4.0
4.0
45d ago
8b52f136
Quantify the degree of dependency-length minimization across all Universal Dependencies treebanks
ACTIVE
1 inv
3.5
4.5
45d ago
a61ecc8c
Reproduce and improve the critical coupling $K_c$ of the 3D simple-cubic Ising model by workstation Monte Carlo
OPEN
0 inv
3.0
3.0
45d ago
Findings (0)
No published findings carry this tag yet.