23 citations · 41 across the 14 of their papers we have counts for
14 papers
Towards Constructing Geodesic Nets with Four Boundary Vertices and an Increasing Number of Balanced Vertices
Fabian Parsch, Hanrui Zhang
We construct a geodesic net in the plane with four boundary (unbalanced) vertices that has 25 balanced vertices and that is irreducible, i.e. it does not contain nontrivial subnets…
Efficiently Solving Turn-Taking Stochastic Games with Extensive-Form Correlation
Hanrui Zhang, Yu Cheng, Vincent Conitzer
We study equilibrium computation with extensive-form correlation in two-player turn-taking stochastic games. Our main results are two-fold: (1) We give an algorithm for computing a…
Nonbossy Mechanisms: Mechanism Design Robust to Secondary Goals
Renato Paes Leme, Jon Schneider, Hanrui Zhang
We study mechanism design when agents may have hidden secondary goals which will play a role when the primary utility of the outcomes is the same. We show that in such cases, a mec…
Autobidding Auctions in the Presence of User Costs
Yuan Deng, Jieming Mao, Vahab Mirrokni +2
We study autobidding ad auctions with user costs, where each bidder is value-maximizing subject to a return-over-investment (ROI) constraint, and the seller aims to maximize the so…
Efficiency of the First-Price Auction in the Autobidding World
Yuan Deng, Jieming Mao, Vahab Mirrokni +2
We study the price of anarchy of the first-price auction in the autobidding world, where bidders can be either utility maximizers (i.e., traditional bidders) or value maximizers (i…
Efficient Algorithms for Planning with Participation Constraints
Hanrui Zhang, Yu Cheng, Vincent Conitzer
We consider the problem of planning with participation constraints introduced in [Zhang et al., 2022]. In this problem, a principal chooses actions in a Markov decision process, re…
Automated Mechanism Design for Classification with Partial Verification
Hanrui Zhang, Yu Cheng, Vincent Conitzer
We study the problem of automated mechanism design with partial verification, where each type can (mis)report only a restricted set of types (rather than any other type), induced b…
Classification with Strategically Withheld Data
Anilesh K. Krishnaswamy, Haoming Li, David Rein +2
Machine learning techniques can be useful in applications such as credit approval and college admission. However, to be classified more favorably in such contexts, an agent may dec…
Nearly Linear Row Sampling Algorithm for Quantile Regression
Yi Li, Ruosong Wang, Lin Yang +1
We give a row sampling algorithm for the quantile loss function with sample complexity nearly linear in the dimensionality of the data, improving upon the previous best algorithm w…
Mitigating Manipulation in Peer Review via Randomized Reviewer Assignments
Steven Jecmen, Hanrui Zhang, Ryan Liu +3
We consider three important challenges in conference peer review: (i) reviewers maliciously attempting to get assigned to certain papers to provide positive reviews, possibly as pa…
Capturing Complementarity in Set Functions by Going Beyond Submodularity/Subadditivity
Wei Chen, Shang-Hua Teng, Hanrui Zhang
We introduce two new "degree of complementarity" measures, which we refer to, respectively, as supermodular width and superadditive width. Both are formulated based on natural witn…
Complete Submodularity Characterization in the Comparative Independent Cascade Model
Wei Chen, Hanrui Zhang
We study the propagation of comparative ideas or items in social networks. A full characterization for submodularity in the comparative independent cascade (Com-IC) model of two-id…
An Improved Algorithm for Incremental DFS Tree in Undirected Graphs
Lijie Chen, Ran Duan, Ruosong Wang +2
Depth first search (DFS) tree is one of the most well-known data structures for designing efficient graph algorithms. Given an undirected graph with vertices and …
Unit-sphere games
Pingzhong Tang, Hanrui Zhang
This paper introduces a class of games, called unit-sphere games, where strategies are real vectors with unit 2-norms (or, on a unit-sphere). As a result, they can no longer be int…