An optimal multiprocessor combinatorial auction solver

DOI10.1016/j.cor.2007.08.001zbMath1152.91475OpenAlexW2016412637MaRDI QIDQ947953

Shouxi Yang, Alberto Maria Segre, Bruno Codenotti

Publication date: 8 October 2008

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2007.08.001

zbMATH Keywords

branch and boundparallel computingwinner determinationcombinatorial auctionsnagging

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Parallel algorithms in computer science (68W10) Auctions, bargaining, bidding and selling, and other market models (91B26)

Related Items (1)

A Pareto-metaheuristic for a bi-objective winner determination problem in a combinatorial reverse auction

Uses Software

• PVM
• MPI/MPICH
• NAGSAT

Cites Work

• A high-performance, portable implementation of the MPI message passing interface standard
• BOB: Improved winner determination in combinatorial auctions and generalizations
• Nagging: A distributed, adversarial search-pruning technique applied to first-order inference
• Nagging: A scalable fault-tolerant paradigm for distributed search
• Computationally Manageable Combinational Auctions
• Combinatorial Auctions: A Survey
• A novel asynchronous parallelism scheme for first-order logic

This page was built for publication: An optimal multiprocessor combinatorial auction solver