Cover Image

An Exercise in Tournament Design: When Some Matches Must Be Scheduled

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Gupta, Sushmita, Ramanujan, M. S., Strulo, Peter
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms Computer Science and Game Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Tractable Graph Structures in EFX Orientation
by: Blažej, Václav, et al.
Published: (2025)

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

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

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

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)

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

More Efforts Towards Fixed-Parameter Approximability of Multiwinner Rules
by: Gupta, Sushmita, et al.
Published: (2025)

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

Conflict and Fairness in Resource Allocation
by: Bandopadhyay, Susobhan, et al.
Published: (2024)

Stable Hypergraph Matching in Unimodular Hypergraphs
by: Biró, Péter, et al.
Published: (2025)

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

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

Fair Repetitive Interval Scheduling
by: Heeger, Klaus, et al.
Published: (2024)

Robust Popular Matchings
by: Bullinger, Martin, et al.
Published: (2024)

Stable Matching with Interviews
by: Ashlagi, Itai, et al.
Published: (2025)

Selfish, Local and Online Scheduling via Vector Fitting
by: Kashaev, Danish
Published: (2025)

A Reduction from Chores Allocation to Job Scheduling
by: Huang, Xin, et al.
Published: (2023)

Stable Matching with Deviators and Conformists
by: Glitzner, Frederik, et al.
Published: (2026)

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

Fairness and Efficiency in Online Class Matching
by: Hajiaghayi, MohammadTaghi, et al.
Published: (2024)

Edge-Weighted Online Bipartite Matching
by: Fahrbach, Matthew, et al.
Published: (2020)

Online Matching Meets Sampling Without Replacement
by: Huang, Zhiyi, et al.
Published: (2024)

Prophet Secretary and Matching: the Significance of the Largest Item
by: Chen, Ziyun, et al.
Published: (2024)

Prophet Upper Bounds for Online Matching and Auctions
by: Soto, José, et al.
Published: (2024)

Optimal Capacity Modification for Stable Matchings with Ties
by: Ranjan, Keshav, et al.
Published: (2024)

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

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

Fairness and Efficiency in Two-Sided Matching Markets
by: Jain, Pallavi, et al.
Published: (2025)

A Minimax Perspective on Almost-Stable Matchings
by: Glitzner, Frederik, et al.
Published: (2026)

The Distortion of Prior-Independent b-Matching Mechanisms
by: Caragiannis, Ioannis, et al.
Published: (2026)

Truthful Matching with Online Items and Offline Agents
by: Feldman, Michal, et al.
Published: (2022)

MATWA: A Web Toolkit for Matching under Preferences
by: Glitzner, Frederik, et al.
Published: (2024)

Approximating Nash Social Welfare by Matching and Local Search
by: Garg, Jugal, et al.
Published: (2022)

The NTU Partitioned Matching Game for International Kidney Exchange Programs
by: Csáji, Gergely, et al.
Published: (2024)

Optimal Competitive Ratio of Two-sided Online Bipartite Matching
by: Tang, Zhihao Gavin
Published: (2026)

Beyond the Half-Approximation: Fair and Efficient Online Class Matching
by: Borst, Sander, et al.
Published: (2026)

Stable Matching with Predictions: Robustness and Efficiency under Pruned Preferences
by: McCauley, Samuel, et al.
Published: (2026)

Unsolvability and Beyond in Many-To-Many Non-Bipartite Stable Matching
by: Glitzner, Frederik, et al.
Published: (2025)

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