Kangning Wang

Orcid: 0000-0001-8688-2478

Affiliations:
  • Rutgers University, Piscataway, NJ, USA
  • Duke University, Durham, NC, USA (former)
  • Tsinghua University, Beijing, China (former)


According to our database1, Kangning Wang authored at least 23 papers between 2017 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Optimal algorithms for multiwinner elections and the Chamberlin-Courant Rule.
Soc. Choice Welf., February, 2025

Majorized Bayesian Persuasion and Fair Selection.
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

2024
Breaking the Metric Voting Distortion Barrier.
J. ACM, December, 2024

Six Candidates Suffice to Win a Voter Majority.
CoRR, 2024

Prior-Independent Auctions for Heterogeneous Bidders.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Fair Price Discrimination.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023
Optimal Pricing Schemes for an Impatient Buyer.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Regret Minimization with Noisy Observations.
Proceedings of the 24th ACM Conference on Economics and Computation, 2023

2022
Auditing for Core Stability in Participatory Budgeting.
Proceedings of the Web and Internet Economics - 18th International Conference, 2022

Approximately efficient bilateral trade.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Approximate Core for Committee Selection via Multilinear Extension and Market Clearing.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

The Limits of an Information Intermediary in Auction Design.
Proceedings of the EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11, 2022

Interactive Communication in Bilateral Trade.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

2021
A Simple Mechanism for a Budget-Constrained Buyer.
ACM Trans. Economics and Comput., 2021

Centrality with Diversity.
Proceedings of the WSDM '21, 2021

Online Stochastic Matching with Edge Arrivals.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

Fair for All: Best-effort Fairness Guarantees for Classification.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2020
Group Fairness in Committee Selection.
ACM Trans. Economics and Comput., 2020

Predict and Match: Prophet Inequalities with Uncertain Supply.
Proc. ACM Meas. Anal. Comput. Syst., 2020

Approximately stable committee selection.
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

2019
Improved Metric Distortion for Deterministic Social Choice Rules.
Proceedings of the 2019 ACM Conference on Economics and Computation, 2019

2017
k-Regret Minimizing Set: Efficient Algorithms and Hardness.
Proceedings of the 20th International Conference on Database Theory, 2017

K-Memory Strategies in Repeated Games.
Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017


  Loading...