Cover Image

A flow-based ascending auction to compute buyer-optimal Walrasian prices

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Eickhoff, Katharina, McCormick, S. Thomas, Peis, Britta, Rieken, Niklas, Koch, Laura Vargas
Format:	Preprint
Published:	2023
Subjects:	Computer Science and Game Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Simplified Analysis of the Ascending Auction to Sell a Matroid Base
by: Peis, Britta, et al.
Published: (2024)

Faster Dynamic Auctions via Polymatroid Sum
by: Eickhoff, Katharina, et al.
Published: (2023)

Carroll Mechanisms: Opportunities, Challenges, and Agenda
by: Brown, Philip N., et al.
Published: (2026)

Improved learning rates in multi-unit uniform price auctions
by: Potfer, Marius, et al.
Published: (2025)

An efficiency ordering of k-price auctions under complete information
by: Goel, Sumit, et al.
Published: (2025)

Side-by-side first-price auctions with imperfect bidders
by: Heymann, Benjamin
Published: (2025)

Detecting collusion in procurement auctions
by: Efimov, Konstantin D.
Published: (2024)

Deterministic implementation in single-item auctions
by: Liu, Yan, et al.
Published: (2025)

Randomized learning-augmented auctions with revenue guarantees
by: Caragiannis, Ioannis, et al.
Published: (2024)

A dynamic auction for multilateral collaboration
by: Huang, Chao
Published: (2024)

Fare Zone Assignment on Trees
by: Hoefer, Martin, et al.
Published: (2025)

A semi-parametric approach for estimating consumer valuation distributions using second price auctions
by: Mukherjee, Sourav, et al.
Published: (2023)

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

Nash Flows Over Time with Tolls
by: Rosner, Shaul, et al.
Published: (2025)

Continuity, Uniqueness and Long-Term Behavior of Nash Flows Over Time
by: Olver, Neil, et al.
Published: (2021)

An improved bound for the price of anarchy for related machine scheduling
by: Berger, Andre, et al.
Published: (2024)

No-Regret Online Autobidding Algorithms in First-price Auctions
by: Deng, Yuan, et al.
Published: (2025)

How competitive are pay-as-bid auction games?
by: Vanelli, Martina, et al.
Published: (2025)

A pragmatic policy learning approach to account for users' fatigue in repeated auctions
by: Heymann, Benjamin, et al.
Published: (2024)

Do backrun auctions protect traders?
by: Macpherson, Andrew W.
Published: (2024)

Bounds on the revenue gap of linear posted pricing for selling a divisible item
by: Caragiannis, Ioannis, et al.
Published: (2020)

Fast, optimal, and dynamic electoral campaign budgeting by a generalized Colonel Blotto game
by: Valles, Thomas, et al.
Published: (2024)

Thresholds for sensitive optimality and Blackwell optimality in stochastic games
by: Gaubert, Stéphane, et al.
Published: (2025)

Stronger core results with multidimensional prices
by: Braverman, Mark, et al.
Published: (2026)

Efficient representations for team and imperfect-recall equilibrium computation
by: Carminati, Luca, et al.
Published: (2026)

Does bilevel optimization result in more competitive racing behavior?
by: Cinar, Andrew, et al.
Published: (2024)

Branch-and-price with novel cuts, and a new Stackelberg Security Game
by: Bustamante-Faúndez, Pamela, et al.
Published: (2024)

Bayes correlated equilibria, no-regret dynamics in Bayesian games, and the price of anarchy
by: Fujii, Kaito
Published: (2023)

Learning to Bid Optimally and Efficiently in Adversarial First-price Auctions
by: Han, Yanjun, et al.
Published: (2020)

On the optimality of Shapley mechanism for funding public excludable goods under Sybil strategies
by: Mazorra, Bruno
Published: (2023)

Production-Inventory games: a new class of totally balanced combinatorial optimization games
by: Guardiola, Luis A., et al.
Published: (2024)

Application of Nash equilibrium for developing an optimal forest harvesting strategy in Toruń Forest District
by: Kotlarz, Jan
Published: (2024)

Optimal No-regret Learning in Repeated First-price Auctions
by: Han, Yanjun, et al.
Published: (2020)

The Simplicity of Optimal Dynamic Mechanisms
by: Correa, Jose, et al.
Published: (2024)

The (Marginal) Value of a Search Ad: An Online Causal Framework for Repeated Second-price Auctions
by: Wen, Yuxiao, et al.
Published: (2026)

An Axiomatic Foundation for Decisions with Counterfactual Utility
by: Koch, Benedikt, et al.
Published: (2026)

On the price of exact truthfulness in incentive-compatible online learning with bandit feedback: A regret lower bound for WSU-UX
by: Mortazavi, Ali, et al.
Published: (2024)

Non-Exclusive Notifications for Ride-Hailing at Lyft II: Simulations and Marketplace Analysis
by: Ekbatani, Farbod, et al.
Published: (2026)

Reputation-based Persuasion Platforms
by: Arieli, Itai, et al.
Published: (2023)

Fixed-budget and Multiple-issue Quadratic Voting
by: Georgescu, Laura, et al.
Published: (2024)