Image de couverture de livre

The Complexity of Min-Max Optimization with Product Constraints

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Bernasconi, Martino, Castiglioni, Matteo
Format:	Preprint
Publié:	2026
Sujets:	Computational Complexity Computer Science and Game Theory
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Improved Hardness Results for Min-Max Optimization with Coupled Constraints
par: Bernasconi, Martino, et autres
Publié: (2024)

Min-Max Optimization Requires Exponentially Many Queries
par: Bernasconi, Martino, et autres
Publié: (2026)

The Complexity of Symmetric Equilibria in Min-Max Optimization and Team Zero-Sum Games
par: Anagnostides, Ioannis, et autres
Publié: (2025)

The Complexity of Correlated Equilibria in Generalized Games
par: Bernasconi, Martino, et autres
Publié: (2025)

Regret-Minimizing Contracts: Agency Under Uncertainty
par: Bernasconi, Martino, et autres
Publié: (2024)

Single-dimensional Contract Design: Efficient Algorithms and Learning
par: Bernasconi, Martino, et autres
Publié: (2025)

Agent-Designed Contracts: How to Sell Hidden Actions
par: Bernasconi, Martino, et autres
Publié: (2024)

Multi-Agent Contract Design beyond Binary Actions
par: Cacciamani, Federico, et autres
Publié: (2024)

Feature-Based Online Bilateral Trade
par: Gaucher, Solenne, et autres
Publié: (2024)

Constrained Phi-Equilibria
par: Bernasconi, Martino, et autres
Publié: (2023)

Committee Elections with Candidate Attribute Constraints
par: Zhou, Aizhong, et autres
Publié: (2024)

No-Regret Learning in Bilateral Trade via Global Budget Balance
par: Bernasconi, Martino, et autres
Publié: (2023)

On the Complexity of Learning Nash Equilibria
par: Biggar, Oliver, et autres
Publié: (2026)

The Computational Complexity of the Housing Market
par: Lock, Edwin, et autres
Publié: (2024)

On the Smoothed Complexity of Combinatorial Local Search
par: Giannakopoulos, Yiannis, et autres
Publié: (2022)

The Complexity of Symmetric Bimatrix Games with Common Payoffs
par: Ghosh, Abheek, et autres
Publié: (2024)

The Complexity of Optimizing Atomic Congestion
par: Brand, Cornelius, et autres
Publié: (2023)

Modelling Network Resilience: The Complexity of Some Graph Division Games
par: Gutowski, Grzegorz, et autres
Publié: (2026)

On the Complexity of Stationary Nash Equilibria in Discounted Perfect Information Stochastic Games
par: Hansen, Kristoffer Arnsfelt, et autres
Publié: (2025)

Complexity of Manipulation and Bribery in Premise-Based Judgment Aggregation with Simple Formulas
par: Bredereck, Robert, et autres
Publié: (2024)

Ex-post Stability under Two-Sided Matching: Complexity and Characterization
par: Aziz, Haris, et autres
Publié: (2024)

A Computational Analysis of Strategic Nominations: Modeling Equilibrium and Complexity in Organizational Elections
par: Lin, Chuang-Chieh, et autres
Publié: (2023)

The Randomized Query Complexity of Finding a Tarski Fixed Point on the Boolean Hypercube
par: Brânzei, Simina, et autres
Publié: (2024)

Complexity of Round-Robin Allocation with Potentially Noisy Queries
par: Li, Zihan, et autres
Publié: (2024)

Complexity of Stability in Trading Networks
par: Fleiner, Tamás, et autres
Publié: (2018)

Structural Complexities of Matching Mechanisms
par: Gonczarowski, Yannai A., et autres
Publié: (2022)

The Complexity of Sparse Win-Lose Bimatrix Games
par: Batziou, Eleni, et autres
Publié: (2026)

Computational Social Choice: Parameterized Complexity and Challenges
par: Chen, Jiehua, et autres
Publié: (2024)

Constant Inapproximability for Fisher Markets
par: Deligkas, Argyrios, et autres
Publié: (2026)

Bribery's Influence on Ranked Aggregation
par: Jain, Pallavi, et autres
Publié: (2026)

Fisher Markets with Approximately Optimal Bundles and the Need for a PCP Theorem for PPAD
par: Deligkas, Argyrios, et autres
Publié: (2026)

Minimizing the Cost of EFx Allocations
par: Deltl, Eva
Publié: (2026)

Necessary President in Elections with Parties
par: Cechlárová, Katarína, et autres
Publié: (2026)

Hardness of Approximate Hylland-Zeckhauser Equilibria
par: Braverman, Mark, et autres
Publié: (2026)

How to Resolve Envy by Adding Goods
par: Bentert, Matthias, et autres
Publié: (2025)

Smoothed analysis of deterministic discounted and mean-payoff games
par: Loff, Bruno, et autres
Publié: (2024)

Disrupting Bipartite Trading Networks: Matching for Revenue Maximization
par: D'Amico-Wong, Luca, et autres
Publié: (2024)

Controlling Borda Elections by Adding or Deleting either Votes or Candidates: Complete and Top-Truncated Votes
par: Zhou, Aizhong, et autres
Publié: (2024)

Hardness of Approximate Sperner and Applications to Envy-Free Cake Cutting
par: Gao, Ruiquan, et autres
Publié: (2024)

Skating System Unveiled: Exploring Preference Aggregation in Ballroom Tournaments
par: Horn, Laryssa, et autres
Publié: (2025)