2 papers
math.CO2026
An upper bound on the proper hat guessing number of graphs
Ioannis Kakatelis
We study the proper hat guessing game on graphs, introduced by Adriaensen et al. in Hat guessing with proper colorings. In this game, the players are seated on the vertices of a gr…
cs.GT2026
Almost EFX in Hypergraphs
Ioannis Kakatelis, Thanasis Lianeas, Alkmini Sgouritsa +1
We study the existence of envy-free-up-to-any-good (EFX) allocations of indivisible goods among agents with heterogeneous monotone valuations. Christodoulou et al. (2023) introduce…