2 papers
math.PR2026
Planted clique recovery in random geometric graphs
Konstantin Avrachenkov, Andrei Bobu, Nelly Litvak +1
We investigate the problem of identifying planted cliques in random geometric graphs, focusing on two distinct algorithmic approaches: the first based on vertex degrees (VD) and th…
econ.TH2026
Calibrated Forecasting and Persuasion
Atulya Jain, Vianney Perchet
We study a dynamic game where an expert sends probabilistic forecasts to a decision-maker. The decision-maker verifies these forecasts using a calibration test based on past data.…