Optimal pricing in iterative flexible combinatorial procurement auctions

DOI10.1016/J.EJOR.2019.03.043MaRDI QIDQ1740561zbMATH OpenOpenAlexFDO

Authors Bahareh Mansouri, Elkafi Hassini

Publication date 30 April 2019

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2019.03.043

zbMATH Keywords

auctions/biddingbidders pricingcombinatorial auctionsflexible auctionsLagrange multipliers

Mathematics Subject Classification ID

Auctions, bargaining, bidding and selling, and other market models (91B26)

Recommendations

• Pricing in combinatorial auctions
• Optimal multi-unit combinatorial auctions
• scientific article; zbMATH DE number 1816801
• Iterative Combinatorial Auctions with Bidder-Determined Combinations
• Bid evaluation in procurement auctions with piecewise linear supply curves

Cites work

• A Lagrangian approach to the winner determination problem in iterative combinatorial reverse auctions
• Branch on Price: A Fast Winner Determination Algorithm for Discount Auctions
• Compact bidding languages and supplier selection for markets with economies of scale and scope
• Computationally manageable combinational auctions
• Exact algorithms for procurement problems under a total quantity discount structure
• Multiattribute electronic procurement using goal programming
• Network flows. Theory, algorithms, and applications.
• Nonconvex piecewise linear knapsack problems
• On approximate graph colouring and MAX-k-CUT algorithms based on the -function
• Transportation Procurement with Seasonally Varying Shipper Demand and Volume Guarantees

Cited in

(8)

• Compact bidding languages and supplier selection for markets with economies of scale and scope
• Bid evaluation in procurement auctions with piecewise linear supply curves
• An exact method for the combinatorial bids generation problem with uncertainty on clearing prices, bids success, and contracts materialization
• Item Pricing for Combinatorial Public Projects
• A study of auction mechanisms for multilateral procurement based on subgradient and bundle methods
• Optimal auctions for multi-unit procurement with volume discount bids
• When (and how) to favor incumbents in optimal dynamic procurement auctions
• Pricing in multiple-item procurement auctions with a common to all items fixed cost

This page was built for publication: Optimal pricing in iterative flexible combinatorial procurement auctions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1740561)