Computing a Walrasian Equilibrium in Iterative Auctions with Multiple Differentiated Items

DOI10.1007/978-3-642-45030-3_44zbMath1407.91131OpenAlexW1702046889MaRDI QIDQ2872111

Zaifu Yang, Kazuo Murota, Akiyoshi Shioura

Publication date: 14 January 2014

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-45030-3_44

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Special types of economic equilibria (91B52) Auctions, bargaining, bidding and selling, and other market models (91B26)

Related Items

Note on time bounds of two-phase algorithms for \(L\)-convex function minimization, Strategyproof allocation mechanisms with endowments and M-convex distributional constraints, Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting), Time bounds for iterative auctions: a unified approach by discrete convex analysis, Designing matching mechanisms under constraints: an approach from discrete convex analysis, Exact bounds for steepest descent algorithms of $L$-convex function minimization, Computing Walrasian equilibria: fast algorithms and structural properties