Combinatorial auctions: a survey
From MaRDI portal
Publication:2884560
DOI10.1287/IJOC.15.3.284.16077zbMATH Open1238.91003OpenAlexW2110383956WikidataQ29398777 ScholiaQ29398777MaRDI QIDQ2884560FDOQ2884560
Authors: 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
Recommendations
Combinatorial optimization (90C27) Auctions, bargaining, bidding and selling, and other market models (91B26) Research exposition (monographs, survey articles) pertaining to game theory, economics, and finance (91-02)
Cited In (only showing first 100 items - show all)
- Solving the set packing problem via a maximum weighted independent set heuristic
- 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
- Combinatorial auctions
- Combinatorial auctions
- Used car salesman problem: a differential auction-barter market
- Greedy algorithm for the general multidimensional knapsack problem
- Truthful approximation mechanisms for restricted combinatorial auctions
- Design for optimized multi-lateral multi-commodity markets
- Combinatorial auction design
- Heuristic algorithms for visiting the customers in a rolling schedule environment
- Hierarchical package bidding: a paper \& pencil combinatorial auction
- Approximation of Walrasian equilibrium in single-minded auctions
- A new bidding framework for combinatorial e-auctions
- Stochastic set packing problem
- Data dependent worst case bounds for weighted set packing
- A combinatorial auction improves school meals in Chile: a case of OR in developing countries
- Ascending price Vickrey auctions for general valuations
- Bid evaluation in procurement auctions with piecewise linear supply curves
- An effective discrete dynamic convexized method for solving the winner determination problem
- Modeling the Pre Auction Stage The Truckload Case
- A branch and cut solver for the maximum stable set problem
- Walrasian equilibrium: Hardness, approximations and tractable instances
- Mechanisms for a spatially distributed market
- On the determination of European day ahead electricity prices: the Turkish case
- Combinatorial auctions for electronic business
- Combinatorial auction design
- Location-based techniques for the synergy approximation in combinatorial transportation auctions
- The communication requirements of efficient allocations and supporting prices
- Discrete location for bundled demand points
- A hybrid branch-and-bound approach for exact rational mixed-integer programming
- On complexity of single-minded auction
- A polyhedral study on 0-1 knapsack problems with set packing constraints
- Bayesian Combinatorial Auctions
- A model and heuristic algorithms for multi-unit nondiscriminatory combinatorial auction
- Multi-object auctions with resale: theory and experiment
- Iterative Combinatorial Auctions with Bidder-Determined Combinations
- Pricing combinatorial auctions by a set of linear price vectors
- A Pareto-metaheuristic for a bi-objective winner determination problem in a combinatorial reverse auction
- Block order restrictions in combinatorial electric energy auctions
- Multi-attribute online reverse auctions: recent research trends
- Problem reduction heuristic for the \(0\)-\(1\) multidimensional knapsack problem
- Computationally manageable combinational auctions
- Combinatorial auctions. Foreword by Vernon L. Smith.
- Pricing in multiple-item procurement auctions with a common to all items fixed cost
- An interactive approach for bi-attribute multi-item auctions
- The freight allocation problem with lane cost balancing constraint
- Metaheuristic approaches for the winner determination problem in combinatorial auction
- Automated design of revenue-maximizing combinatorial auctions
- Combinatorial auctions with decreasing marginal utilities
- An optimal multiprocessor combinatorial auction solver
- Exact algorithms for the matrix bid auction
- Non-linear anonymous pricing combinatorial auctions
- Modeling profit sharing in combinatorial exchanges by network flows
- Compact bidding languages and supplier selection for markets with economies of scale and scope
- Combinatorial Auctions with Verification Are Tractable
- Bundling equilibrium in combinatorial auctions
- Approximation algorithms for combinatorial auctions with complement-free bidders
- Allocative efficiency in simulated multiple-unit combinatorial auctions with quantity support
- A multi-attribute e-auction mechanism for procurement: theoretical foundations
- Alternative formulations for the set packing problem and their application to the winner determination problem
- Collaborating freight forwarding enterprises
- Auctions with bidder-determined allowable combinations
- Emerging multiple issue e-auctions
- A pricing scheme for combinatorial auctions based on bundle sizes
- Heuristics for a bidding problem
- Computer science and decision theory
- An exact rational mixed-integer programming solver
- Dual relaxations of the time-indexed ILP formulation for min-sum scheduling problems
- The stochastic bid generation problem in combinatorial transportation auctions
- Iterative Dutch combinatorial auctions
- Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method
- A new pricing scheme based on DEA for iterative multi-unit combinatorial auctions
- Incentive compatible mulit-unit combinatorial auctions: a primal dual approach
- A fast approximation algorithm for solving the complete set packing problem
- Optimal and Efficient Auctions for the Gradual Procurement of Strategic Service Provider Agents
- The impact of partial production capacity sharing via production as a service
- Collaborative transportation for attended home deliveries
- Request evaluation strategies for carriers in auction-based collaborations
- The polyhedral geometry of truthful auctions
- Simple combinatorial auctions with budget constraints
- Solving multi-mode resource-constrained multi-project scheduling problem with combinatorial auction mechanisms
- Optimal RSUs placement with delay bounded message dissemination in vehicular networks
- A study of auction mechanisms for multilateral procurement based on subgradient and bundle methods
- A hybrid ant colony algorithm for the winner determination problem
- Pricing and clearing combinatorial markets with singleton and swap orders. Efficient algorithms for the futures opening auction problem
- Why votes have value: instrumental voting with overconfidence and overestimation of others' errors
- A constraint programming approach to extract the maximum number of non-overlapping test forms
- Product-mix auctions and tropical geometry
- Coordination of manufacturing and engineering activities during product transitions
- Foundations of mechanism design: a tutorial. I. Key concepts and classical results
- Foundations of mechanism design: a tutorial. II. Advanced concepts and results
- Enabling assisted strategic negotiations in actual-world procurement scenarios
- Integrating production scheduling and transportation procurement through combinatorial auctions
- Allocation of advertising space by a web service provider using combinatorial auctions
- On monotone strategy equilibria in simultaneous auctions for complementary goods
- A multi-unit tender award process: The case of Transantiago
- A double-sided multiunit combinatorial auction for substitutes: Theory and algorithms
- Dividing bads under additive utilities
- On bidding algorithms for a distributed combinatorial auction
This page was built for publication: Combinatorial auctions: a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2884560)
