A new algorithm for the incomplete-information game of coding learns adversary preferences through repeated interactions and achieves sublinear cumulative regret by focusing search on promising acceptance rules.
Lagrange coded computing: Optimal design for resiliency, security, and privacy
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.IT 2years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
Equilibria and optimal strategies are characterized for a two-repetition vector coding game in Euclidean space with one rational adversary.
citing papers explorer
-
Learning from Acceptance: Cumulative Regret in the Game of Coding
A new algorithm for the incomplete-information game of coding learns adversary preferences through repeated interactions and achieves sublinear cumulative regret by focusing search on promising acceptance rules.
-
Game of Coding for Vector-Valued Computations
Equilibria and optimal strategies are characterized for a two-repetition vector coding game in Euclidean space with one rational adversary.