27 citations · 32 across the 10 of their papers we have counts for
15 papers
From No-Regret to Strategically Robust Learning in Repeated Auctions
Junyao Zhao
In Bayesian single-item auctions, a monotone bidding strategy--one that prescribes a higher bid for a higher value type--can be equivalently represented as a partition of the quant…
UniSearch: Rethinking Search System with a Unified Generative Architecture
Jiahui Chen, Xiaoze Jiang, Zhibo Wang +18
Modern search systems play a crucial role in facilitating information acquisition. Traditional search engines typically rely on a cascaded architecture, where results are retrieved…
Fixed-Parameter Tractable Submodular Maximization over a Matroid
Shamisa Nematollahi, Adrian Vladu, Junyao Zhao
In this paper, we design fixed-parameter tractable (FPT) algorithms for (non-monotone) submodular maximization subject to a matroid constraint, where the matroid rank is treate…
Universal Online Contention Resolution with Preselected Order
Junyao Zhao
Online contention resolution scheme (OCRS) is a powerful technique for online decision making, which--in the case of matroids--given a matroid and a prior distribution of active el…
Spot Risks Before Speaking! Unraveling Safety Attention Heads in Large Vision-Language Models
Ziwei Zheng, Junyao Zhao, Le Yang +2
With the integration of an additional modality, large vision-language models (LVLMs) exhibit greater vulnerability to safety risks (e.g., jailbreaking) compared to their language-o…
Strategizing against No-Regret Learners in First-Price Auctions
Aviad Rubinstein, Junyao Zhao
We study repeated first-price auctions and general repeated Bayesian games between two players, where one player, the learner, employs a no-regret learning algorithm, and the other…
The Power of Menus in Contract Design
Guru Guruganesh, Jon Schneider, Joshua Wang +1
We study the power of menus of contracts in principal-agent problems with adverse selection (agents can be one of several types) and moral hazard (we cannot observe agent actions d…
Multi-Channel Auction Design in the Autobidding World
Gagan Aggarwal, Andres Perlroth, Junyao Zhao
Over the past few years, more and more Internet advertisers have started using automated bidding for optimizing their advertising campaigns. Such advertisers have an optimization g…
Beyond Worst-Case Budget-Feasible Mechanism Design
Aviad Rubinstein, Junyao Zhao
Motivated by large-market applications such as crowdsourcing, we revisit the problem of budget-feasible mechanism design under a "small-bidder assumption". Anari, Goel, and Nikzad…
Maximizing Non-Monotone Submodular Functions over Small Subsets: Beyond -Approximation
Aviad Rubinstein, Junyao Zhao
In this work we give two new algorithms that use similar techniques for (non-monotone) submodular function maximization subject to a cardinality constraint. The first is an offline…
Cardinality constrained submodular maximization for random streams
Paul Liu, Aviad Rubinstein, Jan Vondrak +1
We consider the problem of maximizing submodular functions in single-pass streaming and secretaries-with-shortlists models, both with random arrival order. For cardinality constrai…
The Randomized Communication Complexity of Randomized Auctions
Aviad Rubinstein, Junyao Zhao
We study the communication complexity of incentive compatible auction-protocols between a monopolist seller and a single buyer with a combinatorial valuation function over item…
Budget-Smoothed Analysis for Submodular Maximization
Aviad Rubinstein, Junyao Zhao
The greedy algorithm for monotone submodular function maximization subject to cardinality constraint is guaranteed to approximate the optimal solution to within a factor. A…
Exponential Communication Separations between Notions of Selfishness
Aviad Rubinstein, Raghuvansh R. Saxena, Clayton Thomas +2
We consider the problem of implementing a fixed social choice function between multiple players (which takes as input a type from each player and outputs an outcome $f(t_…
Robust Maximization of Non-Submodular Objectives
Ilija Bogunovic, Junyao Zhao, Volkan Cevher
We study the problem of maximizing a monotone set function subject to a cardinality constraint in the setting where some number of elements is deleted from the returned set…