Hanrui Zhang

Orcid: 0000-0001-8991-0622

Affiliations:
  • Chinese University of Hong Kong, Hong Kong
  • Google, Inc. (former)
  • Carnegie Mellon University, Pittsburgh, PA, USA (former)
  • Duke University, Durham, NC, USA (former)
  • Tsinghua University, IIIS, Beijing, China (former)


According to our database1, Hanrui Zhang authored at least 49 papers between 2016 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Auto-Bidding and Auctions in Online Advertising: A Survey.
SIGecom Exch., 2024

Aggregating Quantitative Relative Judgments: From Social Choice to Ranking Prediction.
CoRR, 2024

Efficiency of the Generalized Second-Price Auction for Value Maximizers.
Proceedings of the ACM on Web Conference 2024, 2024

Computational Aspects of Bayesian Persuasion under Approximate Best Response.
Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2024, 2024

Aggregating Quantitative Relative Judgments: From Social Choice to Ranking Prediction.
Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2024, 2024

Efficiency of the First-Price Auction in the Autobidding World.
Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2024, 2024

Autobidder's Dilemma: Why More Sophisticated Autobidders Lead to Worse Auction Efficiency.
Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2024, 2024

Strategic Littlestone Dimension: Improved Bounds on Online Strategic Classification.
Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2024, 2024

Non-excludable Bilateral Trade between Groups.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Nonbossy Mechanisms: Mechanism Design Robust to Secondary Goals.
CoRR, 2023

Eligibility Mechanisms: Auctions Meet Information Retrieval.
Proceedings of the ACM Web Conference 2023, 2023

Autobidding Auctions in the Presence of User Costs.
Proceedings of the ACM Web Conference 2023, 2023

Efficiently Solving Turn-Taking Stochastic Games with Extensive-Form Correlation.
Proceedings of the 24th ACM Conference on Economics and Computation, 2023

2022
Improved prophet inequalities for combinatorial welfare maximization with (approximately) subadditive agents.
J. Comput. Syst. Sci., 2022

Efficient Algorithms for Planning with Participation Constraints.
Proceedings of the EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11, 2022

Posted Pricing and Dynamic Prior-independent Mechanisms with Value Maximizers.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Near-Optimal Reviewer Splitting in Two-Phase Paper Reviewing and Conference Experiment Design.
Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022

Planning with Participation Constraints.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

Learning Influence Adoption in Heterogeneous Networks.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Online Combinatorial Auctions.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Automated Dynamic Mechanism Design.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Prior-independent Dynamic Auctions for a Value-maximizing Buyer.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Incentive-Aware PAC Learning.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Classification with Few Tests through Self-Selection.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Automated Mechanism Design for Classification with Partial Verification.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Classification with Strategically Withheld Data.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
A graph-theoretical basis of stochastic-cascading network influence: Characterizations of influence-based centrality.
Theor. Comput. Sci., 2020

On the Equivalence Between High-Order Network-Influence Frameworks: General-Threshold, Hypergraph-Triggering, and Logic-Triggering Models.
CoRR, 2020

Planning with Submodular Objective Functions.
CoRR, 2020

A Generic Truthful Mechanism for Combinatorial Auctions.
Proceedings of the Web and Internet Economics - 16th International Conference, 2020

Combinatorial Ski Rental and Online Bipartite Matching.
Proceedings of the EC '20: The 21st ACM Conference on Economics and Computation, 2020

Mitigating Manipulation in Peer Review via Randomized Reviewer Assignments.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Learning the Valuations of a k-demand Agent.
Proceedings of the 37th International Conference on Machine Learning, 2020

Nearly Linear Row Sampling Algorithm for Quantile Regression.
Proceedings of the 37th International Conference on Machine Learning, 2020

Learning Opinions in Social Networks.
Proceedings of the 37th International Conference on Machine Learning, 2020

2019
Complete submodularity characterization in the comparative independent cascade model.
Theor. Comput. Sci., 2019

Distinguishing Distributions When Samples Are Strategically Transformed.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Provably Efficient Q-learning with Function Approximation via Distribution Shift Error Checking Oracle.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Capturing Complementarity in Set Functions by Going Beyond Submodularity/Subadditivity.
Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019

When Samples Are Strategically Selected.
Proceedings of the 36th International Conference on Machine Learning, 2019

A Better Algorithm for Societal Tradeoffs.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

A PAC Framework for Aggregating Agents' Judgments.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

Learning Set Functions with Limited Complementarity.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
A Systematic Framework and Characterization of Influence-Based Network Centrality.
CoRR, 2018

An Improved Algorithm for Incremental DFS Tree in Undirected Graphs.
Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 2018

Approximation-Variance Tradeoffs in Facility Location Games.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
Unit-sphere games.
Int. J. Game Theory, 2017

Efficient Near-optimal Algorithms for Barter Exchange.
Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

2016
Improved Algorithms for Maintaining DFS Tree in Undirected Graphs.
CoRR, 2016


  Loading...