Cover Image

Minimal Regret Walras Equilibria for Combinatorial Markets

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Duguet, Aloïs, Harks, Tobias, Schmidt, Martin, Schwarz, Julian
Format:	Preprint
Published:	2025
Subjects:	Computer Science and Game Theory Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Branch-and-Cut for Computing Approximate Equilibria of Mixed-Integer Generalized Nash Games
by: Duguet, Aloïs, et al.
Published: (2025)

Branch-and-Cut for Mixed-Integer Nash Equilibrium Problems
by: Duguet, Aloïs, et al.
Published: (2025)

Side-Constrained Dynamic Traffic Equilibria
by: Graf, Lukas, et al.
Published: (2022)

The Price of Anarchy for Instantaneous Dynamic Equilibria
by: Graf, Lukas, et al.
Published: (2020)

Are System Optimal Dynamic Flows Implementable by Tolls?
by: Graf, Lukas, et al.
Published: (2025)

Generalized Nash Equilibrium Problems with Mixed-Integer Variables
by: Harks, Tobias, et al.
Published: (2021)

Stochastic Prediction Equilibrium for Dynamic Traffic Assignment
by: Graf, Lukas, et al.
Published: (2024)

Machine-Learned Prediction Equilibrium for Dynamic Traffic Assignment
by: Graf, Lukas, et al.
Published: (2021)

Adaptive Incentive Design with Regret Minimization
by: Vasileiou, Georgios, et al.
Published: (2026)

The Cut-and-Play Algorithm: Computing Nash Equilibria via Outer Approximations
by: Carvalho, Margarida, et al.
Published: (2021)

Convergence of Approximate and Packet Routing Equilibria to Nash Flows Over Time
by: Olver, Neil, et al.
Published: (2024)

A Coupled Optimization Framework for Correlated Equilibria in Normal-Form Game
by: Li, Sarah H. Q., et al.
Published: (2024)

On Approximate Nash Equilibria in Mean Field Games
by: Djete, Mao Fabrice, et al.
Published: (2026)

New Combinatorial Insights for Monotone Apportionment
by: Cembrano, Javier, et al.
Published: (2024)

Online Contention Resolution Schemes for Network Revenue Management and Combinatorial Auctions
by: Ma, Will, et al.
Published: (2024)

Evolutionary Dynamics in Continuous-time Finite-state Mean Field Games -- Part I: Equilibria
by: Pedroso, Leonardo, et al.
Published: (2025)

A Cardinality-Constrained Approach to Combinatorial Bilevel Congestion Pricing
by: Guo, Lei, et al.
Published: (2024)

Near-Optimal Regret-Queue Length Tradeoff in Online Learning for Two-Sided Markets
by: Yang, Zixian, et al.
Published: (2025)

Operator Splitting for Learning to Predict Equilibria in Convex Games
by: McKenzie, Daniel, et al.
Published: (2021)

Equilibria in Network Constrained Markets with System Operator
by: Como, Giacomo, et al.
Published: (2024)

The Effects of Transmission-Rights Pricing on Multi-Stage Electricity Markets
by: de Saint-Lienard, Erwann de Belloy, et al.
Published: (2024)

Optimal Selection with Balanced Market Share: Static and Dynamic Assortment Optimization
by: Housni, Omar El, et al.
Published: (2025)

The Second-Order Tâtonnement: Decentralized Interior-Point Methods for Market Equilibrium
by: Zhang, Chuwen, et al.
Published: (2025)

Small-Gain Nash: Certified Contraction to Nash Equilibria in Differentiable Games
by: Sharma, Vedansh
Published: (2025)

Convergence of Regret Matching in Potential Games and Constrained Optimization
by: Anagnostides, Ioannis, et al.
Published: (2025)

Computing and Learning Stationary Mean Field Equilibria with Scalar Interactions: Algorithms and Applications
by: Light, Bar
Published: (2025)

A No-Regret Framework for Adaptive Incentive Design
by: Vasileiou, Georgios, et al.
Published: (2026)

Faster Rates for No-Regret Learning in General Games via Cautious Optimism
by: Soleymani, Ashkan, et al.
Published: (2025)

Achieving Logarithmic Regret in KL-Regularized Zero-Sum Markov Games
by: Nayak, Anupam, et al.
Published: (2025)

Cautious Optimism: A Meta-Algorithm for Near-Constant Regret in General Games
by: Soleymani, Ashkan, et al.
Published: (2025)

Doubly Optimal No-Regret Online Learning in Strongly Monotone Games with Bandit Feedback
by: Ba, Wenjia, et al.
Published: (2021)

Evolutionary Games on Infinite Strategy Sets: Convergence to Nash Equilibria via Dissipativity
by: Anderson, Brendon G., et al.
Published: (2023)

Online Generalized-mean Welfare Maximization: Achieving Near-Optimal Regret from Samples
by: Yang, Zongjun, et al.
Published: (2026)

Weakest Bidder Types and New Core-Selecting Combinatorial Auctions
by: Prasad, Siddharth, et al.
Published: (2025)

Adaptive, Doubly Optimal No-Regret Learning in Strongly Monotone and Exp-Concave Games with Gradient Feedback
by: Jordan, Michael I., et al.
Published: (2023)

A Soft Inducement Framework for Incentive-Aided Steering of No-Regret Players
by: Yorulmaz, Asrin Efe, et al.
Published: (2025)

On the Convergence of Tâtonnement for Linear Fisher Markets
by: Nan, Tianlong, et al.
Published: (2024)

Near-feasible Fair Allocations in Two-sided Markets
by: Cembrano, Javier, et al.
Published: (2025)

Markov Chains of Evolutionary Games with a Small Number of Players
by: Kehagias, Athanasios
Published: (2025)

Deviation Between Team-Optimal Solution and Nash Equilibrium in Flow Assignment Problems
by: Xu, Gehui, et al.
Published: (2025)