Risk-minimizing GUE-implementations of truthful reporting in a Dynamic Social Choice Problem
Resumo indisponível. Consulte o paper original.
PAPER / ARXIV:2609.14525
Zhipeng Lu , Sichen Wang
RESUMO
We study how far a fixed Ramsey upper bound can be improved by descending through blue neighborhoods in one vertex set while keeping a second set fixed. A weighted inequality in the two set sizes determines when the descent can stop. For the source bound specified here, the infimum diagonal exponent over all finite derivations lies in $[1.305,\,1.307]$. A finite derivation gives $R(k,k)\le3.69507^k$ for all sufficiently large $k$; a concave polygon proves the lower bound for every finite depth. We also characterize the infimum as a greatest fixed point and show that every larger exponent has a finite derivation valid uniformly for nearby clique-size ratios.
NO MESMO MAPA
Resumo indisponível. Consulte o paper original.