Cover Image

Adaptive Manipulation for Coalitions in Knockout Tournaments

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Chaudhary, Juhi, Molter, Hendrik, Zehavi, Meirav
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms Computer Science and Game Theory Multiagent Systems
Online Access:	Acceder al recurso
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)

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

Parameterized Analysis of Bribery in Challenge the Champ Tournaments
by: Chaudhary, Juhi, et al.
Published: (2024)

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

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

Equilibria in multiagent online problems with predictions
by: Istrate, Gabriel, et al.
Published: (2024)

EFX Exists for Three Types of Agents
by: HV, Vishwa Prakash, et al.
Published: (2024)

Leakage-Robust Bayesian Persuasion
by: Haghtalab, Nika, et al.
Published: (2024)

Platforms for Efficient and Incentive-Aware Collaboration
by: Haghtalab, Nika, et al.
Published: (2024)

Reducing Leximin Fairness to Utilitarian Optimization
by: Hartman, Eden, et al.
Published: (2024)

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

Online Fair Division: Towards Ex-Post Constant MMS Guarantees
by: Kulkarni, Pooja, et al.
Published: (2025)

Fairly Wired: Towards Leximin-Optimal Division of Electricity
by: Hartman, Eden, et al.
Published: (2025)

Group Fair Matchings using Convex Cost Functions
by: Panda, Atasi, et al.
Published: (2025)

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

Extending Stable and Popular Matching Algorithms from Bipartite to Arbitrary Instances
by: Csáji, Gergely
Published: (2024)

A Simple 1.5-Approximation Algorithm for a Wide Range of Max-SMTI Problems
by: Csáji, Gergely
Published: (2023)

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

Keeping the Harmony Between Neighbors: Local Fairness in Graph Fair Division
by: Hummel, Halvard, et al.
Published: (2024)

Online Coalition Formation under Random Arrival or Coalition Dissolution
by: Bullinger, Martin, et al.
Published: (2023)

Stability in Online Coalition Formation
by: Bullinger, Martin, et al.
Published: (2023)

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

Minimum Temporal Spanners in Happy Graphs
by: Casteigts, Arnaud, et al.
Published: (2026)

The Geometry of Coalition Power: Majorization, Lattices, and Displacement in Multiwinner Elections
by: Guo, Qian, et al.
Published: (2026)

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)

Single-Deviation Stability in Additively Separable Hedonic Games with Constrained Coalition Sizes
by: Bullinger, Martin, et al.
Published: (2025)

Treewidth Parameterized by Feedback Vertex Number
by: Molter, Hendrik, et al.
Published: (2025)

A Parameterized Perspective on Uniquely Restricted Matchings
by: Chaudhary, Juhi, et al.
Published: (2025)

Risk-Sensitive Online Selection with Bounded Adaptivity
by: Nekouyan, Hossein, et al.
Published: (2025)

From Necklaces to Coalitions: Fair and Self-Interested Distribution of Coalition Value Calculations
by: Payne, Terry R., et al.
Published: (2026)

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

Approximating the Core via Iterative Coalition Sampling
by: Gemp, Ian, et al.
Published: (2024)

Stability Under Valuation Updates in Coalition Formation
by: Frank, Fabian, et al.
Published: (2026)

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)

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

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

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

A Little Aggression Goes a Long Way
by: Krishnan, Jyothi, et al.
Published: (2024)

Structural and Algorithmic Results for Stable Cycles and Partitions in the Roommates Problem
by: Glitzner, Frederik, et al.
Published: (2024)