Seventh IEEE International Conference on E-Commerce Technology (CEC'05)
DOI: 10.1109/icect.2005.36
|View full text |Cite
|
Sign up to set email alerts
|

Design of Combinatorial Auctions for Allocation and Procurement Processes

Abstract: The application of combinatorial auctions in procurement and allocation processes can help to achieve higher efficiency by taking the substitutionalities and complementarities of bundled goods valuation into consideration. The article describes criteria for the analysis, conceptualization and modeling of web-based combinatorial procurement and allocation systems. The foundations of combinatorial auctions are illustrated, followed by a view on several procedural variants. A number of obstacles such as design an… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
10
0

Publication Types

Select...
2
2
2

Relationship

0
6

Authors

Journals

citations
Cited by 11 publications
(10 citation statements)
references
References 19 publications
0
10
0
Order By: Relevance
“…At this point, we will not discuss the game theory implications concerning truthful bidding and incentive compatibility, because the delivery costs that provide the basis for the formation of the bid prices in each profit center are calculated solely by the DynaRoute server and are therefore difficult to manipulate (Schwind 2005). Figure 10 illustrates three ComEx clients generating combinatorial bids (B i , p i ) with bid prices p i (represented by squares) for cluster bundle B i (represented by ovals) and send them to the ComEx server.…”
Section: (C) Validation Processmentioning
confidence: 99%
See 2 more Smart Citations
“…At this point, we will not discuss the game theory implications concerning truthful bidding and incentive compatibility, because the delivery costs that provide the basis for the formation of the bid prices in each profit center are calculated solely by the DynaRoute server and are therefore difficult to manipulate (Schwind 2005). Figure 10 illustrates three ComEx clients generating combinatorial bids (B i , p i ) with bid prices p i (represented by squares) for cluster bundle B i (represented by ovals) and send them to the ComEx server.…”
Section: (C) Validation Processmentioning
confidence: 99%
“…Combinatorial auctions are increasingly gaining influence as an allocation method for industrial procurement and distribution processes (Schwind 2005). Typical domains are supply chain management, resource allocation in distributed computer systems, and exchanges for logistics services (Stockheim and Schwind 2004;Schwind et al 2006).…”
Section: Combinatorial Auctions For Logistics Exchangesmentioning
confidence: 99%
See 1 more Smart Citation
“…This is the case in domains like supply chain management scheduling, procurement or logistics (Schwind 2005). One application of CAs in the sector of logistics is to use them for the exchange of transportation capacities while taking the synergies that are generated by the appropriate allocation of bundles of transportation tasks to different carriers into consideration .…”
Section: Case 3: Combinatorial Auctionsmentioning
confidence: 99%
“…For each atomic bid b i j a request is sent to the DynaRoute server to determine the delivery costs associated with this bid. At this point, the game-theoretical implications concerning truthful bidding and incentive compatibility will not be discussed, because the delivery costs that provide the basis for the formation of the bid prices in each logistics service provider are calculated solely by the DynaRoute server and are therefore difficult to manipulate [12].…”
Section: ) Utility Factor For Customersmentioning
confidence: 99%