Bidding Languages for Continuous Auctions

Mariusz Kaleta

Abstract

Bidding languages are well-defined for combinatorial auctions. However, the auctions of divisible goods are quite common in practice. In contrast to combinatorial auctions, in a case of divisible commodities, the feasible volumes of offers are continuous. Thus, we call such auctions as continuous auctions. In the paper we introduce three families of bidding languages for continuous auctions. Their are based on the concepts derived from the combinatorial auctions. We generalize the language families based on goods, bids, and some mixture of both of them, to the continuous case. We also present preliminary analysis of their properties. Simple examples, reflecting the complementarity and substitutability, are provided with the exemplary representations in different languages.
Author Mariusz Kaleta (FEIT / AK)
Mariusz Kaleta,,
- The Institute of Control and Computation Engineering
Pages211-220
Publication size in sheets0.5
Book Pechenizkiy Mykola, Wojciechowski Marek (eds.): New Trends in Databases and Information Systems, Advances in Intelligent Systems and Computing, vol. 185, 2013, Heidelberg New York Dordrecht London, Springer-Verlag, ISBN 978-3-642-32517-5, 452 p., DOI:10.1007/978-3-642-32518-2
New Trends in Databases and Information Systems.pdf / 248.82 KB / No licence information
DOIDOI:10.1007/978-3-642-32518-2_20
URL http://link.springer.com/chapter/10.1007%2F978-3-642-32518-2_20
Languageen angielski
Score (nominal)15
Score sourceconferenceIndex
ScoreMinisterial score = 10.0, 13-07-2020, BookChapterSeriesAndMatConfByIndicator
Ministerial score (2013-2016) = 15.0, 13-07-2020, BookChapterSeriesAndMatConfByIndicator
Publication indicators WoS Citations = 1
Citation count*
Cite
Share Share

Get link to the record


* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.
Back
Confirmation
Are you sure?