Idan Orzech

collaborators

2 papers

cs.IT2025

Bounds on Unique-Neighbor Codes

Nati Linial, Edan Orzech

Recall that a binary linear code of length $n$ is a linear subspace $C = {x \in F_{2}^{n} ∣ A x = 0}$ . Here the parity check matrix $A$ is a binary $m \times n$ matrix…

cs.GT2024

Correlated vs. Uncorrelated Randomness in Adversarial Congestion Team Games

Edan Orzech, Martin Rinard

We consider team zero-sum network congestion games with $n$ agents playing against $k$ interceptors over a graph $G$ . The agents aim to minimize their collective cost of sending tr…