A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
Filters
A Heuristic for Winner Determination in Rule-Based Combinatorial Auctions
2005
INFORMS journal on computing
Preserved Fulltext
First, we give a general approach to providing good approximations to the winner determination problem for rule-based auctions. ...
We consider a rich version of combinatorial auctions, rule-based combinatorial auctions, where bids consist of rules that describe acceptable bundles rather than provide complete enumerations of acceptable ...
and presented a heuristic solution approach for winner determination of rule-based combinatorial auctions. ...
doi:10.1287/ijoc.1040.0072
fatcat:3wozmyev3zbx3jzzjoq5zvq7wi
Selecting unique suppliers through winner determination in combinatorial reverse auction: scatter search algorithm
2017
Scientia Iranica. International Journal of Science and Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
In this paper, a combinatorial reverse auction mechanism is proposed to select suppliers for the required items of a company. ...
The corresponding winner determination problem is formulated as a binary integer program which is an NP-complete combinatorial optimization problem. ...
Since a combinatorial auction mechanism is de ned by a set of rules related to bidding and winner determination process [9] , the company must determine the rules of combinatorial reverse auction mechanism ...
doi:10.24200/sci.2017.4394
fatcat:mbckpce6q5dgpml37pppzrpsz4
An iterative combinatorial auction design for fractional ownership of autonomous vehicles
2020
International Transactions in Operational Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
We present a practical iterative auction based on the combinatorial clock auction to match the interested customers together and determine their payments. ...
This study designs a new market for fractional ownership of autonomous vehicles (AVs), in which an AV is co-leased by a group of individuals. ...
Kwon acknowledges partial support through a University of South Florida Nexus Initiative (UNI) Award. ...
doi:10.1111/itor.12903
fatcat:ncs53famn5gtrpf6vsp7fucfai
An Iterative Online Auction for Airline Seats
[chapter]
2002
IMA Volumes in Mathematics and its Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is application/pdf.
Each iteration of the mechanism can be thought of as a general combinatorial auction where customers bid on bundles of flights. ...
Due to their low cost and ease of access, online auctions are a very popular way of selling perishable excess inventory in the travel industry. ...
Acknowledgements Thanks to Manoj Kumar for posing the original problem and to Peter Eso, David Parkes, Laszlo Ladanyi and the anonymous reviewers for providing valuable suggestions. ...
doi:10.1007/978-1-4684-9277-4_4
fatcat:lf2sfl7jgvbqbdl3b72f2e7vze
Allocation of advertising space by a web service provider using combinatorial auctions
2005
Sadhana (Bangalore)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
In this paper, we propose a multi-slot and multi-site combinatorial auction for allocating scarce advertisement slots available on multiple sites. ...
We resort to "ant" systems (ant -social insect/intelligent agent) to solve the above N P-hard combinatorial optimization problem which involves winner-determination in multi-item and multi-unit combinatorial ...
We thank the anonymous referees for providing their valuable comments on earlier drafts which helped in improving the presentation style and also the content of the paper. ...
doi:10.1007/bf02706245
fatcat:acfa4l5f4bezhnm4qk4ghe5iii
Testing BOI and BOB Algorithms for Solving the Winner Determination Problem in Radio Spectrum Auctions
2008
2008 Eighth International Conference on Hybrid Intelligent Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
An important handicap of combinatorial auctions is determining the winner bids among many options, that is, solving the winner determination problem (WDP). ...
Combinatorial auctions are a promising auction format for allocating radio spectrum, as well as other goods. ...
An important rule to specify in a combinatorial auction is that of the bidding language. The most frequent ones are the OR and XOR bidding languages. ...
doi:10.1109/his.2008.21
dblp:conf/his/SaezMBI08
fatcat:alsadowfg5fodccjcmqph6ocie
An Analysis of Design Problems in Combinatorial Procurement Auctions
2009
Business & Information Systems Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
A number of fundamental design considerations are relevant to the application of combinatorial auctions in procurement. ...
Combinatorial auctions are promising auction formats for industrial and public procurement. ...
The winner determination problem First, we will concentrate on the winner determination problem in combinatorial procurement auctions. ...
doi:10.1007/s12599-008-0014-3
fatcat:65xt6jjbt5a5rpziwrpgckxu2u
Optimization Method using Combinatorial Auction for Production Scheduling with Batch Processing
2010
Journal of Advanced Mechanical Design, Systems, and Manufacturing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Therefore, as described in this paper, we propose a simultaneous optimization method for batch formation and scheduling with a combinatorial auction mechanism. ...
Combinatorial-auction based scheduling is one potential method of autonomously distributed scheduling. ...
We use a kind of local search methods to select the combined bids based on heuristic rules. The details are described in this section. ...
doi:10.1299/jamdsm.4.588
fatcat:4vfmguwexzba3cejxvxxzgmiza
Mini track: 'data and process mining'
2004
37th Annual Hawaii International Conference on System Sciences, 2004. Proceedings of the
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
Nandy and Mahanti review existing approaches and propose a heuristic and an algorithm called Iterative Threshold Search for optimal winner determination in combinatorial auctions. ...
They integrate the beneficial features of IDA and DFBB search algorithms depending on the upper-bound heuristic for determining the revenue maximizing set of winning bids. ...
Nandy and Mahanti review existing approaches and propose a heuristic and an algorithm called Iterative Threshold Search for optimal winner determination in combinatorial auctions. ...
doi:10.1109/hicss.2004.1265197
dblp:conf/hicss/PiramuthuC04
fatcat:bychholugnhf5m7u6b27i4slfm
A Winner Determination Algorithm for Combinatorial Auctions Based on Hybrid Artificial Fish Swarm Algorithm
2012
Physics Procedia
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The problem of winner determination in combinatorial auctions is a hotspot electronic business, and a NP hard problem. ...
Experiment results show that the HAFSA is a rapidly and efficient algorithm for The problem of winner determining. ...
i i bidders b S MAX b S . (1) The bids described below are preprocessed, then the model of winner determination problems in combinatorial auctions can be described as follows [6] , ( ) X A S X MAX b ...
doi:10.1016/j.phpro.2012.03.292
fatcat:hwzvzhozunbwlijakynme33oli
Combinatorial auctions using rule-based bids
2002
Decision Support Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is application/pdf.
We describe a new type of combinatorial auction that accepts rule-based bids. ...
We describe simplifying winner determination heuristics developed in this study to make large problems of this nature manageable. ...
The heuristic methodology to facilitate winner determination within the proposed auction mechanism is defined in Section 5. ...
doi:10.1016/s0167-9236(02)00004-0
fatcat:zyhxkudabfgzxi4e62fcfbgbqm
Market Segmentation Within Consolidated E-Markets: A Generalized Combinatorial Auction Approach
2006
Journal of Management Information Systems
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
A heuristic for winner determination in rule-based combina- torial auctions. INFORMS Journal on Computing, 17, 4 (Fall 2005), 475-489.
11. Kwasnica, A.M.; Ledyard, J.O.; Porter, D.; and DeMartini, C. ...
Thus, in the rule-based auction found in Jones and Koehler [9, 10], bids are repre- sented by a bid amount and collection of rules that are translated into a mixed-integer program (the winner determination ...
doi:10.2753/mis0742-1222230105
fatcat:fz6tepv3zrdsvarrjlhvqi5xhq
Constraint-Based Winner Determination for Auction-Based Scheduling
2009
IEEE transactions on systems, man and cybernetics. Part A. Systems and humans
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This paper presents a formulation and an algorithm for the winner determination problem in auction-based scheduling. ...
The performance of the proposed algorithm is evaluated through experiments versus a set of auction-based scheduling winner determination problems generated based on a suite of job shop constraint satisfaction ...
Preliminaries on combinatorial auctions Auctions are a mediated negotiation process that allocates goods to bidders according to predefined rules based on bidders' bids. ...
doi:10.1109/tsmca.2009.2013194
fatcat:u54hs5jkbfbjvb4pw3vukn25em
CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions
2005
Management science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
Combinatorial auctions where bidders can bid on bundles of items can lead to more economically efficient allocations, but determining the winners is N P-complete and inapproximable. ...
We present CABOB, a sophisticated optimal search algorithm for the problem. ...
We are currently working not only on designing faster algorithms for winner determination in combinatorial auctions, but also on winner determination in combinatorial reverse auctions and exchanges Kothari ...
doi:10.1287/mnsc.1040.0336
fatcat:yswy75xdhbhc3bgjo47bxunzpi
Forthcoming Papers
2003
Artificial Intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The GRT heuristic is based on the estimation of the distances between each fact of a problem and the goals. ...
The new planner, called MO-GRT, uses a weighted A * strategy and a multiobjective heuristic function, computed over a weighted hierarchy of user-defined criteria. ...
Suri, BOB: Improved winner determination in combinatorial auctions and generalizations Combinatorial auctions can be used to reach efficient resource and task allocations in multiagent systems where the ...
doi:10.1016/s0004-3702(03)00031-6
fatcat:vv67l2cr4vevzh7tzkehconbjq
« Previous
Showing results 1 — 15 out of 711 results