Algorithm for optimal winner determination in combinatorial auctions
Artificial Intelligence
Combinatorial auctions using rule-based bids
Decision Support Systems
BOB: improved winner determination in combinatorial auctions and generalizations
Artificial Intelligence
Towards Automated Procurement via Agent-Aware Negotiation Support
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 1
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Simulating combinatorial auctions with dominance requirement and loll bids through automated agents
Decision Support Systems
Bidding in sealed-bid and English multi-attribute auctions
Decision Support Systems
The Landscape of Electronic Market Design
Management Science
Iterative Combinatorial Auctions with Bidder-Determined Combinations
Management Science
A combinatorial procurement auction featuring bundle price revelation without free-riding
Decision Support Systems
Bidding algorithms for a distributed combinatorial auction
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Enacting agent-based services for automated procurement
Engineering Applications of Artificial Intelligence
Approximate bidding algorithms for a distributed combinatorial auction
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3
A Computational Analysis of Linear Price Iterative Combinatorial Auction Formats
Information Systems Research
Expressive commerce and its application to sourcing
IAAI'06 Proceedings of the 18th conference on Innovative applications of artificial intelligence - Volume 2
Solving Truckload Procurement Auctions Over an Exponential Number of Bundles
Transportation Science
Auctions and bidding: A guide for computer scientists
ACM Computing Surveys (CSUR)
A public procurement combinatorial auction mechanism with quality assignment
Decision Support Systems
An Experimental Comparison of Linear and Nonlinear Price Combinatorial Auctions
Information Systems Research
Interval subset sum and uniform-price auction clearing
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Improved multi-unit auction clearing algorithms with interval (multiple-choice) knapsack problems
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Decomposing combinatorial auctions and set packing problems
Journal of the ACM (JACM)
Bailout forward contracts for edge-to-edge internet services
Computer Communications
The impact of non-neutral federal regulatory policy on competition
Telecommunications Policy
On bidding algorithms for a distributed combinatorial auction
Multiagent and Grid Systems
| Hi-index | 0.01 |
We describe a discrete-time auction procedure called PAUSE (Progressive Adaptive User Selection Environment) for use in assigning COLR (Carrier of Last Resort) responsibility for universal service. The auction incorporates synergies by permitting all combinatorial bids, is transparent to the bidders, allows for multiple winners, and minimizes the possibility of bidder collusion. The procedure is computationally tractable for the auctioneer and thus very efficient to run. The inherent computational complexity of combinatorial bidding cannot be eliminated. However, in this auction the computational burden of evaluating synergies rests with the bidders claiming those synergies, while the auctioneer simply checks that a bid is valid.