Auctions are important market mechanisms for the allocation of goods and services. Auctions are preferred often to other common processes because they are open, quite fair, easiness to understand by participants, and lead to economically efficient outcomes. Design of auctions is a multidisciplinary effort made of contributions from economics, operations research, informatics, and other disciplines. Combinatorial auctions are those auctions in which bidders can place bids on combinations of items, called packages, rather than just individual items. The advantage of combinatorial auctions is that the bidder can more fully express his preferences. This is particular important when items are complements. The multiple evaluation criteria can be used. There are dependencies among sellers, buyers, criteria, bundles of items. A variety of feedback processes creates complex system of items. For the whole structure seems to be very appropriate Analytic Network Process (ANP) approach. The ANP method makes possible to deal systematically with all kinds of dependence and feedback in the system of items. By the ANP approach can be evaluated the preferences of bundles of items. Dynamic Network Process (DNP) as an extension of ANP can deal with time dependent priorities in combinatorial auctions.
combinatorial auctions, preference elicitation, Analytic Network Process, Dynamic Network Process
for electronic auctions. ACM Symposium on Applied Computing, 759-765.
Bichler, M. (2000). An experimental analysis of multi-attribute auctions. Decision
Support Systems, 29, 249- 268.
Bikhchandani, S., & Ostroy, J.M. (2002). The package assignment model. Journal of
Economic Theory, 107, 377–406.
CDF (Creative Decisions Foundation) www page (2000)- www.creativedecisions.net.
Cramton, P., Shoham, Y., & Steinberg, R. (eds.) (2006). Combinatorial Auctions.
Cambridge, MIT Press.
de Vries, S., & Vohra, R.V. (2003). Combinatorial auctions: A survey. INFORMS
Journal of Computing, 15, 284-309,
Fiala, P. (2006). An ANP/DNP analysis of economic elements in today's world network
economy. Journal of Systems Science and Systems Engineering, 15, 131–140.
Fiala, P. (1997). Models of cooperative decision making. Gal, T., & Fandel, G. (eds.).
Multiple Criteria Decision Making, Heidelberg, Springer.
Oliveira, E., Fonsesca, J.M., & Steiger-Garao, A. (1999). Multi-criteria negotiation in
multi-agent systems. 1st International Workshop of Central and Eastern Europe on
Multi-agent Systems (CEEMAS'99), St. Petersburg.
Rothkopf, M., Peke?, A., & Harstad, R. (1998). Computationally manageable
combinational auctions. Management Science, 8, 1131-1147.
Saaty, T.L. (1996). The Analytic Hierarchy Process. Pittsburgh: RWS Publications.
Saaty, T.L. (2001). Decision making with Dependence and Feedback: The Analytic
Network Process. Pittsburgh: RWS Publications.
Saaty, T.L. (2003). Time Dependent Decision-Making; Dynamic Priorities in AHP/ANP:
Generalizing from Points to Functions and from Real to Complex Variables. Proceedings
of the 7th International Conference on the Analytic Hierarchy Process, Bali, Indonesia, 1-
Sandholm, T. (2002). Algorithm for optimal winner determination in combinatorial
auctions. Artificial Intelligence, 135, 1-54.
Sandholm, T., & Boutilier, C. (2006). Preference elicitation in combinatorial auctions.
Cramton, P., Shoham, Y., & Steinberg, R. (eds.). Combinatorial Auctions. Cambridge,
Copyright of all articles published in IJAHP is transferred to Creative Decisions Foundation (CDF). However, the author(s) reserve the following:
- All proprietary rights other than copyright, such as patent rights.
- The right to grant or refuse permission to third parties to republish all or part of the article or translations thereof. In case of whole articles, such third parties must obtain permission from CDF as well. However, CDF may grant rights with respect to journal issues as a whole.
- The right to use all or parts of this article in future works of their own, such as lectures, press releases, reviews, textbooks, or reprint books.
- The authors affirm that the article has been neither copyrighted nor published, that it is not being submitted for publication elsewhere, and that if the work is officially sponsored, it has been released for open publication.
The only exception to the statements in the paragraph above is the following: If an article published in IJAHP contains copyrighted material, such as a teaching case, as an appendix, then the copyright (and all commercial rights) of such material remains with the original copyright holder.
CDF will receive permission for publication of copyrighted material in IJAHP. This permission is not transferable to third parties. Permission to make electronic and paper copies of part or all of the articles, including all computer files that are linked to the articles, for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage.
This permission does not apply to previously copyrighted material, such as teaching cases. In paper copies of the article, the copyright notice and the title of the publication and its date should be visible. To copy otherwise is permitted provided that a per-copy fee is paid.
To republish, to post on servers, or redistribute to lists requires that you post a link to the IJAHP article, which is available in open access delivery mode. Do not upload the article itself.
Authors are permitted to present a talk, based on a paper submitted to or accepted by IJAHP, at a conference where the paper would not be published in a copyrighted publication either before or after the conference and where the author did not assign copyright to the conference or related publisher.