Showing 1–20 of 57 results
/ Date/ Name
Nov 11, 2021Assigning and Scheduling Generalized Malleable Jobs under Subadditive or Submodular Processing SpeedsOct 17, 2024Partially Trained Graph Convolutional Networks Resist OversmoothingJul 22, 2012On the Hardness of Network Design for Bottleneck Routing GamesJul 8, 2015Who to Trust for Truthfully Maximizing Welfare?Nov 12, 2021A Constant-Factor Approximation for Generalized Malleable Scheduling under $M^\natural$-Concave Processing SpeedsJul 4, 2012On the Power of Deterministic Mechanisms for Facility Location GamesAug 21, 2024On the Distortion of Committee Election with 1-Euclidean Preferences and Few Distance QueriesOct 10, 2011On the Efficiency of Influence-and-Exploit Strategies for Revenue Maximization under Positive ExternalitiesOct 7, 2025Analyzing the Effect of Embedding Norms and Singular Values to Oversmoothing in Graph Neural NetworksDec 10, 2013Efficient Lineage for SUM Aggregate QueriesFeb 4, 2020Local Aggregation in Preference GamesMar 26, 2019Malleable scheduling beyond identical machinesJul 26, 2021Strategyproof Facility Location in Perturbation Stable InstancesJul 5, 2020Efficient Parameter Estimation of Truncated Boolean Product DistributionsNov 20, 2019Node Max-Cut and Computing Equilibria in Linear Weighted Congestion GamesAug 2, 2012Enumerating Subgraph Instances Using Map-ReduceMay 29, 2019Reallocating Multiple Facilities on the LineJun 17, 2020Mechanism Design for Perturbation Stable Combinatorial AuctionsJun 8, 2021Efficient Online Learning for Dynamic k-ClusteringMay 15, 2013Strategy-Proof Facility Location for Concave Cost Functions