Combinatorial Auctions: A Survey
From MaRDI portal
Publication:2884560
DOI10.1287/IJOC.15.3.284.16077zbMath1238.91003OpenAlexW2110383956WikidataQ29398777 ScholiaQ29398777MaRDI QIDQ2884560
Sven de Vries, Rakesh V. Vohra
Publication date: 30 May 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/5903e1a7ee42d3b693e2453a2f8adc657a8c0b11
Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to game theory, economics, and finance (91-02) Auctions, bargaining, bidding and selling, and other market models (91B26)
Related Items (only showing first 100 items - show all)
A linear time algorithm to compute a maximum weighted independent set on cocomparability graphs ⋮ A sampling-based stochastic winner determination model for truckload service procurement ⋮ Emerging multiple issue e-auctions ⋮ Solving the set packing problem via a maximum weighted independent set heuristic ⋮ A hybrid ant colony algorithm for the winner determination problem ⋮ Bundling equilibrium in combinatorial auctions ⋮ A new bidding framework for combinatorial e-auctions ⋮ Auctions with bidder-determined allowable combinations ⋮ Location-based techniques for the synergy approximation in combinatorial transportation auctions ⋮ An effective discrete dynamic convexized method for solving the winner determination problem ⋮ On the determination of European day ahead electricity prices: the Turkish case ⋮ Heuristic algorithms for visiting the customers in a rolling schedule environment ⋮ Pricing combinatorial auctions by a set of linear price vectors ⋮ Iterative Auction Design for Tree Valuations ⋮ Mechanisms for a spatially distributed market ⋮ A Pareto-metaheuristic for a bi-objective winner determination problem in a combinatorial reverse auction ⋮ A pricing scheme for combinatorial auctions based on bundle sizes ⋮ An interactive approach for bi-attribute multi-item auctions ⋮ Alternative solution algorithm for winner determination problem with quantity discount of transportation service procurement ⋮ Ascending price Vickrey auctions for general valuations ⋮ Alternative formulations for the set packing problem and their application to the winner determination problem ⋮ Capping methods for the automatic configuration of optimization algorithms ⋮ Discrete location for bundled demand points ⋮ Dividing bads under additive utilities ⋮ An exact method for the combinatorial bids generation problem with uncertainty on clearing prices, bids success, and contracts materialization ⋮ Coordination of manufacturing and engineering activities during product transitions ⋮ Local branching relaxation heuristics for integer linear programs ⋮ A combinatorial auction‐based approach for ridesharing in a student transportation system ⋮ Solving the winner determination problem in combinatorial auctions for fractional ownership of autonomous vehicles ⋮ An iterative combinatorial auction design for fractional ownership of autonomous vehicles ⋮ Product-Mix Auctions and Tropical Geometry ⋮ Winner determination in geometrical combinatorial auctions ⋮ A multi-attribute e-auction mechanism for procurement: theoretical foundations ⋮ The freight allocation problem with lane cost balancing constraint ⋮ Why votes have value: instrumental voting with overconfidence and overestimation of others' errors ⋮ Pricing in multiple-item procurement auctions with a common to all items fixed cost ⋮ Modeling profit sharing in combinatorial exchanges by network flows ⋮ A branch and cut solver for the maximum stable set problem ⋮ Walrasian equilibrium: Hardness, approximations and tractable instances ⋮ Enabling assisted strategic negotiations in actual-world procurement scenarios ⋮ An Exact Rational Mixed-Integer Programming Solver ⋮ An optimal multiprocessor combinatorial auction solver ⋮ A model and heuristic algorithms for multi-unit nondiscriminatory combinatorial auction ⋮ Dual relaxations of the time-indexed ILP formulation for min-sum scheduling problems ⋮ Exact algorithms for the matrix bid auction ⋮ Greedy algorithm for the general multidimensional knapsack problem ⋮ Combinatorial auctions ⋮ Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method ⋮ Problem reduction heuristic for the \(0\)-\(1\) multidimensional knapsack problem ⋮ Data dependent worst case bounds for weighted set packing ⋮ Simple combinatorial auctions with budget constraints ⋮ On complexity of single-minded auction ⋮ Heuristics for a bidding problem ⋮ Optimal RSUs placement with delay bounded message dissemination in vehicular networks ⋮ Design for optimized multi-lateral multi-commodity markets ⋮ Pricing and clearing combinatorial markets with singleton and swap orders. Efficient algorithms for the futures opening auction problem ⋮ Approximation of Walrasian equilibrium in single-minded auctions ⋮ Stochastic set packing problem ⋮ The communication requirements of efficient allocations and supporting prices ⋮ Computer science and decision theory ⋮ Reverse auction-based job assignment among foundry fabs ⋮ Compact bidding languages and supplier selection for markets with economies of scale and scope ⋮ A polyhedral study on 0-1 knapsack problems with set packing constraints ⋮ A constraint programming approach to extract the maximum number of non-overlapping test forms ⋮ Combinatorial auctions with decreasing marginal utilities ⋮ Collaborating freight forwarding enterprises ⋮ Multi-attribute online reverse auctions: recent research trends ⋮ Geometry of gross substitutes valuations ⋮ On monotone strategy equilibria in simultaneous auctions for complementary goods ⋮ Foundations of mechanism design: a tutorial. I. Key concepts and classical results ⋮ Foundations of mechanism design: a tutorial. II. Advanced concepts and results ⋮ A new pricing scheme based on DEA for iterative multi-unit combinatorial auctions ⋮ Request evaluation strategies for carriers in auction-based collaborations ⋮ The stochastic bid generation problem in combinatorial transportation auctions ⋮ A fast approximation algorithm for solving the complete set packing problem ⋮ Truthful approximation mechanisms for restricted combinatorial auctions ⋮ An optimization approach for winner determination problem considering transportation cost discounts ⋮ A multi-unit tender award process: The case of Transantiago ⋮ A hybrid branch-and-bound approach for exact rational mixed-integer programming ⋮ A double-sided multiunit combinatorial auction for substitutes: Theory and algorithms ⋮ The new treatment mode research of hepatitis B based on ant colony algorithm ⋮ SAT encodings for pseudo-Boolean constraints together with at-most-one constraints ⋮ Block order restrictions in combinatorial electric energy auctions ⋮ Exploring the VCG mechanism in combinatorial auctions: the threshold revenue and the threshold-price rule ⋮ Non-linear anonymous pricing combinatorial auctions ⋮ Allocative efficiency in simulated multiple-unit combinatorial auctions with quantity support ⋮ Market-based pricing in grids: on strategic manipulation and computational cost ⋮ Modeling the Pre Auction Stage The Truckload Case ⋮ Combinatorial auctions for electronic business ⋮ Allocation of advertising space by a web service provider using combinatorial auctions ⋮ Bid evaluation in procurement auctions with piecewise linear supply curves ⋮ Conflict and competition over multi-issues ⋮ Multi-object auctions with resale: theory and experiment ⋮ Metaheuristic Approaches for the Winner Determination Problem in Combinatorial Auction ⋮ Incentive compatible mulit-unit combinatorial auctions: a primal dual approach ⋮ Unnamed Item ⋮ Iterative Dutch combinatorial auctions ⋮ Used car salesman problem: a differential auction-barter market ⋮ Solving Multi-Mode Resource-Constrained Multi-Project Scheduling Problem with Combinatorial Auction Mechanisms ⋮ Comparison of four mechanisms for request exchange in collaborative transportation
This page was built for publication: Combinatorial Auctions: A Survey