2 papers
econ.TH2026
Pricing Valid Cuts for Price-Match Equilibria
Robert Day, Benjamin Lubin
We use valid inequalities (cuts) of the binary integer program for winner determination in a combinatorial auction (CA) as "artificial items" that can be interpreted intuitively an…
cs.GT2025
Iterative Vickrey Auctions via Linear Programming
Sébastien Lahaie, Sébastien Lahaie, Benjamin Lubin
Building on the linear programming approach to competitive equilibrium pricing, we develop a general method for constructing iterative auctions that achieve Vickrey-Clarke-Groves (…