:: Library Catalog

Cover Image

Saved in:

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

Similar Items

How Hard Is It to Rig a Tournament When Few Players Can Beat or Be Beaten by the Favorite?
by: Wang, Zhonghao, et al.
Published: (2026)

Weighted Envy-Freeness Revisited: Indivisible Resource and House Allocations
by: Liu, Yuxi, et al.
Published: (2025)

Algorithms and Complexity of Influence Maximization on Directed Acyclic Graphs
by: Liu, Panfeng, et al.
Published: (2026)

Toward Fair and Strategyproof Tournament Rules for Tournaments with Partially Transferable Utilities
by: Pennock, David, et al.
Published: (2024)

Margin of Victory for Weighted Tournament Solutions
by: Döring, Michelle, et al.
Published: (2024)

Metric Distortion for Tournament Voting and Beyond
by: Charikar, Moses, et al.
Published: (2025)

Strategyproof Tournament Rules for Teams with a Constant Degree of Selfishness
by: Pennock, David, et al.
Published: (2025)

On Approximately Strategy-Proof Tournament Rules for Collusions of Size at Least Three
by: Mikšaník, David, et al.
Published: (2024)

The Cost of Failure: On The Complexity of Recampaigning under Fixed Districts
by: Chavrimootoo, Michael C., et al.
Published: (2026)

A Polynomial-Time Algorithm for Fair and Efficient Allocation with a Fixed Number of Agents
by: Mahara, Ryoga
Published: (2024)

Neighborhood Stability in Assignments on Graphs
by: Aziz, Haris, et al.
Published: (2024)

The Inversion Paradox and Ranking Methods in Tournaments
by: Chéze, Guillaume, et al.
Published: (2025)

Deciding regular games: a playground for exponential time algorithms
by: Liang, Zihui, et al.
Published: (2024)

Skating System Unveiled: Exploring Preference Aggregation in Ballroom Tournaments
by: Horn, Laryssa, et al.
Published: (2025)

Network Creation Games with 2-Neighborhood Maximization
by: de la Haye, Merlin, et al.
Published: (2025)

Contracting with a Mechanism Designer
by: Bai, Tian, et al.
Published: (2025)

Connectivity in the presence of an opponent
by: Liang, Zihui, et al.
Published: (2023)

Facility Assignment with Fair Cost Sharing: Equilibrium and Mechanism Design
by: Ma, Mengfan, et al.
Published: (2024)

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

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

Generalizing Better Response Paths and Weakly Acyclic Games
by: Yongacoglu, Bora, et al.
Published: (2024)

The Randomized Query Complexity of Finding a Tarski Fixed Point on the Boolean Hypercube
by: Brânzei, Simina, et al.
Published: (2024)

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

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

Optimal Fixed-Price Mechanism with Signaling
by: Fan, Zhikang, et al.
Published: (2024)

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)

Fixed-budget and Multiple-issue Quadratic Voting
by: Georgescu, Laura, et al.
Published: (2024)

A Stronger Benchmark for Online Bilateral Trade: From Fixed Prices to Distributions
by: Lunghi, Anna, et al.
Published: (2026)

Efficient Near-Optimal Algorithm for Online Shortest Paths in Directed Acyclic Graphs with Bandit Feedback Against Adaptive Adversaries
by: Maiti, Arnab, et al.
Published: (2025)

New Adaptive Mechanism for Large Neighborhood Search using Dual Actor-Critic
by: Yu, Shaohua, et al.
Published: (2026)

Aligning with Human Values to Enhance Interaction: An eHMI-Mediated Lane-Changing Negotiation Strategy Using Bayesian Inference
by: Peng, Boyao, et al.
Published: (2025)

Logarithmic Comparison-Based Query Complexity for Fair Division of Indivisible Goods
by: Bu, Xiaolin, et al.
Published: (2024)

The Complexity of Tullock Contests
by: He, Yu, et al.
Published: (2024)

Incentive Designs for Stackelberg Games with a Large Number of Followers and their Mean-Field Limits
by: Sanjari, Sina, et al.
Published: (2022)

The Sample Complexity of Stackelberg Games
by: Bacchiocchi, Francesco, et al.
Published: (2024)

Complex Dynamics in Autobidding Systems
by: Leme, Renato Paes, et al.
Published: (2024)

The Competition Complexity of Prophet Secretary
by: Ezra, Tomer, et al.
Published: (2024)

The Query Complexity of Uniform Pricing
by: Chen, Houshuang, et al.
Published: (2025)

The Complexity of Correlated Equilibria in Generalized Games
by: Bernasconi, Martino, et al.
Published: (2025)