2 papers
cs.LG2024
Self-Directed Learning of Convex Labelings on Graphs
Georgy Sokolov, Maximilian Thiessen, Margarita Akhmejanova +2
We study the problem of classifying the nodes of a given graph in the self-directed learning setup. This learning setting is a variant of online learning, where rather than an adve…
cs.CC2023
An Exponential Envy-Free Cake Cutting Protocol for Agents
Georgy Sokolov
We consider a classical envy-free cake cutting problem. The first limited protocol was proposed by Aziz and McKenzie in 2016 arXiv:1604.03655. The disadvantage of this protocol is…