The team order problem: maximizing the probability of matching being large enough

DOI10.1007/978-3-031-71033-9_3MaRDI QIDQ7034822zbMATH OpenFDO

Authors Haris Aziz, Jiarui Gan, Grzegorz Lisowski, Ali Pourmiri

Publication date 31 January 2025

Full work available at URL https://doi.org/10.1007/978-3-031-71033-9_3

Mathematics Subject Classification ID

Algorithmic game theory and complexity (91A68) Matching models (91B68)

Cites work

• Assignment Problems
• Binomial approximation to the Poisson binomial distribution
• Budgeted matching and budgeted matroid intersection via the gasoline puzzle
• Concentration of Measure for the Analysis of Randomized Algorithms
• Equilibrium player choices in team contests with multiple pairwise battles
• Handbook of Computational Social Choice
• scientific article; zbMATH DE number 3231692 (Why is no real title available?)
• Matching theory
• Matchings in colored bipartite networks
• Possible and necessary winners of partial tournaments
• Stable matching with uncertain linear preferences
• The Colonel Blotto game
• The Hungarian method for the assignment problem
• The new FIFA rules are hard: Complexity aspects of sports competitions.

This page was built for publication: The team order problem: maximizing the probability of matching being large enough

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7034822)