Pages that link to "Item:Q2872111"
From MaRDI portal
The following pages link to Computing a Walrasian Equilibrium in Iterative Auctions with Multiple Differentiated Items (Q2872111):
Displaying 12 items.
- Time bounds for iterative auctions: a unified approach by discrete convex analysis (Q1751147) (← links)
- Designing matching mechanisms under constraints: an approach from discrete convex analysis (Q1757595) (← links)
- Exact bounds for steepest descent algorithms of $L$-convex function minimization (Q1785253) (← links)
- A dynamic auction for differentiated items under price rigidities (Q1934754) (← links)
- Walrasian's characterization and a universal ascending auction (Q2013362) (← links)
- Computing Walrasian equilibria: fast algorithms and structural properties (Q2288196) (← links)
- Note on time bounds of two-phase algorithms for \(L\)-convex function minimization (Q2400167) (← links)
- Strategyproof allocation mechanisms with endowments and M-convex distributional constraints (Q2680800) (← links)
- Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting) (Q2693050) (← links)
- Iterative Auction Design for Tree Valuations (Q3465578) (← links)
- A fair and truthful mechanism with limited subsidy (Q6494252) (← links)
- A flow-based ascending auction to compute buyer-optimal Walrasian prices (Q6599058) (← links)
