| Autor: |
Baldwin, Elizabeth, Bichler, Martin, Fichtl, Maximilian, Klemperer, Paul |
| Předmět: |
|
| Zdroj: |
Mathematical Programming; Jan2024, Vol. 203 Issue 1/2, p611-643, 33p |
| Abstrakt: |
We show the strong substitutes product-mix auction bidding language provides an intuitive and geometric interpretation of strong substitutes as Minkowski differences between sets that are easy to identify. We prove that competitive equilibrium prices for agents with strong substitutes preferences can be computed by minimizing the difference between two linear programs for the positive and the negative bids with suitably relaxed resource constraints. This also leads to a new algorithm for computing competitive equilibrium prices which is competitive with standard steepest descent algorithms in extensive experiments. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
