The cross-entropy method for the winner determination problem in combinatorial auctions

DOI10.1155/2020/5691719zbMath1459.91066OpenAlexW3092101726MaRDI QIDQ2209236

Jie Xie, Baixiu Ni, Changping Liu, Hanmi Lin, Yong-Qiang Chen

Publication date: 28 October 2020

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2020/5691719

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• An effective discrete dynamic convexized method for solving the winner determination problem
• Winner determination in geometrical combinatorial auctions
• Compact bidding languages and supplier selection for markets with economies of scale and scope
• Heuristics for a bidding problem
• The stochastic bid generation problem in combinatorial transportation auctions
• Computationally Manageable Combinational Auctions
• A Differential Evolution Algorithm for the Winner Determination Problem in Combinatorial Auctions
• Pareto optimal budgeted combinatorial auctions
• Practical Genetic Algorithms
• An Ant Colony Approach for the Winner Determination Problem
• Truthful randomized mechanisms for combinatorial auctions
• MICAI 2004: Advances in Artificial Intelligence
• Risk-free bidding in complement-free combinatorial auctions

This page was built for publication: The cross-entropy method for the winner determination problem in combinatorial auctions