We develop an efficient algorithm to find Walrasian equilibrium prices multi-unit, multi-item product mix-auctions in which participants express strong-substitutes preferences.
Our algorithms are based on DC programming, where the difference of two convex functions is minimized. We develop a DC algorithm to find global optima necessary for Walrasian prices in the product-mix auction and show that the problem is dual to minimizing the Lyapunov function.
Venue: TUM Campus Garching Room 02.04.011
Date: Monday, May 13th, 2019, starting at 14:30