Greedy vector balancing on finite unit-vector sets T in R^d achieves norm bound (2/δ_T)^{d-1} independent of sequence length n.
Milchtaich (1996): Congestion Games with Player-Specific Payoff Functions
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Monadic fixed-point logic with counting is proposed as a natural specification language for properties on improvement graphs in social choice and games, with an efficient model checking algorithm whose complexity depends on graph size.
citing papers explorer
-
Reasoning about Social Choice and Games in Monadic Fixed-Point Logic
Monadic fixed-point logic with counting is proposed as a natural specification language for properties on improvement graphs in social choice and games, with an efficient model checking algorithm whose complexity depends on graph size.