Showing 1–15 of 15 results
/ Date/ Name
Jun 3, 2021Winning the War by (Strategically) Losing Battles: Settling the Complexity of Grundy-Values in Undirected GeographyOct 11, 2014Signaling in Quasipolynomial timeFeb 18, 2026Submodular Maximization under Supermodular Constraint: Greedy GuaranteesSep 12, 2021Nimber-Preserving Reductions and Homomorphic Sprague-Grundy Game EncodingsDec 8, 2009Subgraph Sparsification and Nearly Optimal UltrasparsifiersJan 18, 2021Transverse Wave: an impartial color-propagation game inspired by Social Influence and Quantum NimDec 2, 2008Preference Games and Personalized Equilibria, with Applications to Fractional BGPFeb 26, 2006On the Approximation and Smoothed Complexity of Leontief Market EquilibriaFeb 11, 2006Computing Nash Equilibria: Approximation and Smoothed ComplexityJul 24, 2006Nearly-Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear SystemsOct 20, 2014Fixed-Points of Social Choice: An Axiomatic Approach to Network CommunitiesApr 12, 2007Settling the Complexity of Computing Two-Player Nash EquilibriaAug 25, 2017Network Essence: PageRank Completion and Centrality-Conforming Markov ChainsFeb 16, 2007Paths Beyond Local Search: A Nearly Tight Bound for Randomized Fixed-Point ComputationOct 20, 2014Scalable Parallel Factorizations of SDD Matrices and Efficient Sampling for Gaussian Graphical Models