no code implementations • ICLR 2022 • Arun Rajkumar, Vishnu Veerathu, Abdul Bakey Mir
For any given tournament, we show a novel upper bound on the smallest representation dimension that depends on the least size of the number of unique nodes in any feedback arc set of the flip class associated with a tournament.
