Return to search

Combinatorial Auction Problems

Electronic commerce is becoming more important day by day. Many transactions
and business are done electronically and many people do not want paper work
anymore. When a firm wants to buy raw materials or components, it announces
its need to related websites or in the newspapers. Similar demands and
announcements can be seen almost everywhere nowadays. In this way, it needs to
perform fast and reliable auctions as much as possible. On the other hand, buyers
not only consider cost but also consider a lot of different aspects like quality,
warranty period, lead time etc when they want to purchase something. This
situation leads to more complex problems in the purchasing process.
As a consequence, some researchers started to consider auction mechanisms that
support bids characterized by several attributes in addition to the price (quality of
the product, quantity, terms of delivery, quality of the supplier etc.). These are
referred to as multi-attribute combinatorial auctions.
In this thesis, Combinatorial Auctions are analyzed. Single-attribute multi-unit,
multi-attribute multi-unit combinatorial auction models are studied and an
interactive method is applied for solving the multi-attribute multi-unit
combinatorial auction problem.

Identiferoai:union.ndltd.org:METU/oai:etd.lib.metu.edu.tr:http://etd.lib.metu.edu.tr/upload/3/12608691/index.pdf
Date01 August 2007
CreatorsBaykal, Safak
ContributorsKoksalan, Murat
PublisherMETU
Source SetsMiddle East Technical Univ.
LanguageEnglish
Detected LanguageEnglish
TypeM.S. Thesis
Formattext/pdf
RightsTo liberate the content for public access

Page generated in 0.0014 seconds