:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Wang, Zhonghao, Peng, Junqiang, Liu, Yuxi, Xiao, Mingyu
Format:	Preprint
Published:	2026
Subjects:	Computer Science and Game Theory Data Structures and Algorithms
Online Access:	https://arxiv.org/abs/2601.08530
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

How to Make Knockout Tournaments More Popular?
by: Chaudhary, Juhi, et al.
Published: (2023)

An Exercise in Tournament Design: When Some Matches Must Be Scheduled
by: Gupta, Sushmita, et al.
Published: (2024)

On Controlling Knockout Tournaments Without Perfect Information
by: Blažej, Václav, et al.
Published: (2024)

Robust Value Maximization in Challenge the Champ Tournaments with Probabilistic Outcomes
by: Bhaskar, Umang, et al.
Published: (2026)

How to Balance the Load Online When Jobs and Machines Are Both Selfish?
by: Wang, Wenqian, et al.
Published: (2024)

Edge-weighted Online Stochastic Matching: Beating $1-\frac1e$
by: Yan, Shuyi
Published: (2022)

Maximizing Value in Challenge the Champ Tournaments
by: Bhaskar, Umang, et al.
Published: (2025)

Adaptive Manipulation for Coalitions in Knockout Tournaments
by: Chaudhary, Juhi, et al.
Published: (2024)

Individual Rationality in Topological Distance Games is Surprisingly Hard
by: Deligkas, Argyrios, et al.
Published: (2024)

Fixed Point Computation: Beating Brute Force with Smoothed Analysis
by: Attias, Idan, et al.
Published: (2025)

The Complexity of Tournament Fixing: Subset FAS Number and Acyclic Neighborhoods
by: Liu, Yuxi, et al.
Published: (2026)

When agents choose bundles autonomously: guarantees beyond discrepancy
by: Gupta, Sushmita, et al.
Published: (2026)

Facility Location Games Beyond Single-Peakedness: the Entrance Fee Model
by: Ma, Mengfan, et al.
Published: (2022)

When far is better: The Chamberlin-Courant approach to obnoxious committee selection
by: Gupta, Sushmita, et al.
Published: (2024)

Trading Prophets: How to Trade Multiple Stocks Optimally
by: Rajput, Surbhi, et al.
Published: (2025)

Revisiting Ranking for Online Bipartite Matching with Random Arrivals: the Primal-Dual Analysis
by: Peng, Bo, et al.
Published: (2025)

Improved MMS Approximations for Few Agent Types
by: Garg, Jugal, et al.
Published: (2025)

Covering a Few Submodular Constraints and Applications
by: Bajpai, Tanvi, et al.
Published: (2025)

Online Combinatorial Allocations and Auctions with Few Samples
by: Dütting, Paul, et al.
Published: (2024)

Revisiting Fair and Efficient Allocations for Bivalued Goods
by: Liu, Hui, et al.
Published: (2026)

Additively Competitive Secretaries
by: Mahdian, Mohammad, et al.
Published: (2026)

Optimal Pricing with Unreliable Signals
by: Tang, Zhihao Gavin, et al.
Published: (2026)

Optimal Single-Choice Prophet Inequalities from Samples
by: Rubinstein, Aviad, et al.
Published: (2019)

Multi-Unit Combinatorial Prophet Inequalities
by: Chawla, Shuchi, et al.
Published: (2025)

The Long Arm of Nashian Allocation in Online $p$-Mean Welfare Maximization
by: Huang, Zhiyi, et al.
Published: (2025)

The Average-Value Allocation Problem
by: Bhawalkar, Kshipra, et al.
Published: (2024)

Computing Balanced Solutions for Large International Kidney Exchange Schemes When Cycle Length Is Unbounded
by: Benedek, Márton, et al.
Published: (2023)

Condorcet Dimension and Pareto Optimality for Matchings and Beyond
by: Kavitha, Telikepalli, et al.
Published: (2026)

Best of Both Worlds Guarantees for Equitable Allocations
by: Bhaskar, Umang, et al.
Published: (2025)

Universal Online Contention Resolution with Preselected Order
by: Zhao, Junyao
Published: (2025)

The Min Max Average Cycle Weight Problem
by: Elmalem, Noga Klein, et al.
Published: (2025)

Matching with Nested and Bundled Pandora Boxes
by: Bowers, Robin, et al.
Published: (2024)

A Note on Approximating Weighted Nash Social Welfare with Additive Valuations
by: Feng, Yuda, et al.
Published: (2024)

Online Job Assignment
by: Ekbatani, Farbod, et al.
Published: (2025)

Near-Feasible Stable Matchings: Incentives and Optimality
by: Glitzner, Frederik
Published: (2026)

Data Exchange Markets via Utility Balancing
by: Bhaskara, Aditya, et al.
Published: (2024)

Pandora's Problem with Combinatorial Cost
by: Berger, Ben, et al.
Published: (2023)

Budget-feasible Egalitarian Allocation of Conflicting Jobs
by: Gupta, Sushmita, et al.
Published: (2024)

Solving Woeginger's Hiking Problem: Wonderful Partitions in Anonymous Hedonic Games
by: Constantinescu, Andrei, et al.
Published: (2023)

Randomized Binary and Tree Search under Pressure
by: Caracci, Agustín, et al.
Published: (2024)