Auctions with bidder-determined allowable combinations

DOI10.1016/j.ejor.2003.08.057zbMath1067.91017OpenAlexW2016280825MaRDI QIDQ1887929

Sunju Park, Michael H. Rothkopf

Publication date: 22 November 2004

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

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

zbMATH Keywords

Combinatorial auctionsAuctions/bidding

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Microeconomic theory (price theory and economic markets) (91B24)

Related Items (9)

Optimal bidding in auctions from a game theory perspective ⋮ A benders decomposition algorithm for a bid generation problem in the procurement of three-echelon transportation services ⋮ Transportation service procurement bid construction problem from less than truckload perspective ⋮ Combinatorial auctions ⋮ On the robustness of non-linear personalized price combinatorial auctions ⋮ Computer science and decision theory ⋮ The stochastic bid generation problem in combinatorial transportation auctions ⋮ Block order restrictions in combinatorial electric energy auctions ⋮ Solving Multi-Mode Resource-Constrained Multi-Project Scheduling Problem with Combinatorial Auction Mechanisms

Cites Work

• Computationally Manageable Combinational Auctions
• Combinatorial Auctions: A Survey
• A Combinatorial Auction with Multiple Winners for Universal Service
• Incentives in Teams
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Auctions with bidder-determined allowable combinations