Optimal pricing in iterative flexible combinatorial procurement auctions

DOI10.1016/j.ejor.2019.03.043zbMath1431.91173OpenAlexW2935359384MaRDI QIDQ1740561

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

Lagrange multipliersauctions/biddingcombinatorial auctionsbidders pricingflexible auctions

Mathematics Subject Classification ID

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

Related Items

An exact method for the combinatorial bids generation problem with uncertainty on clearing prices, bids success, and contracts materialization

Cites Work

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