Murota, Kazuo, Shioura, Akiyoshi and Yang, Zaifu orcid.org/0000-0002-3265-7109 (2016) Time bounds for iterative auctions:a unified approach by discrete convex analysis. discrete optimization. pp. 36-62.
Abstract
We investigate an auction model where there are many different goods, each good has multiple units and bidders have gross substitutes valuations over the goods. We analyze the number of iterations in iterative auction algo- rithms for the model based on the theory of discrete convex analysis. By making use of L♮-convexity of the Lyapunov function we derive exact bounds on the number of iterations in terms of the ℓ1-distance between the initial price vector and the found equilibrium. Our results extend and unify the price adjustment algorithms for the multi-unit auction model and for the unit-demand auction model, offering computational complexity results for these algorithms, and reinforcing the connection between auction theory and discrete convex analysis.
Metadata
Item Type: | Article |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | © 2016 Elsevier B.V. All rights reserved. his is an author-produced version of the published paper. Uploaded in accordance with the publisher’s self-archiving policy. Further copying may not be permitted; contact the publisher for details |
Dates: |
|
Institution: | The University of York |
Academic Units: | The University of York > Faculty of Social Sciences (York) > Economics and Related Studies (York) |
Depositing User: | Pure (York) |
Date Deposited: | 26 May 2016 08:31 |
Last Modified: | 16 Oct 2024 12:56 |
Published Version: | https://doi.org/10.1016/j.disopt.2016.01.001 |
Status: | Published |
Refereed: | Yes |
Identification Number: | 10.1016/j.disopt.2016.01.001 |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:100150 |
Download
Filename: iterative_auction_DOrev1.pdf
Description: iterative_auction_DOrev1
Licence: CC-BY-NC-ND 2.5