Combinatorial auctions: a survey
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- 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
- A multi-unit tender award process: The case of Transantiago
- A double-sided multiunit combinatorial auction for substitutes: Theory and algorithms
- 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
- A pricing scheme for combinatorial auctions based on bundle sizes
- Winner determination in geometrical 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
- On complexity of single-minded auction
- A polyhedral study on 0-1 knapsack problems with set packing constraints
- Emerging multiple issue e-auctions
- Bundling equilibrium in combinatorial auctions
- A new bidding framework for combinatorial e-auctions
- Auctions with bidder-determined allowable combinations
- Simple combinatorial auctions with budget constraints
- Optimal RSUs placement with delay bounded message dissemination in vehicular networks
- Pricing and clearing combinatorial markets with singleton and swap orders. Efficient algorithms for the futures opening auction problem
- An optimization approach for winner determination problem considering transportation cost discounts
- 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
- Conflict and competition over multi-issues
- A hybrid ant colony algorithm for the winner determination problem
- Alternative solution algorithm for winner determination problem with quantity discount of transportation service procurement
- Computer science and decision theory
- Compact bidding languages and supplier selection for markets with economies of scale and scope
- Geometry of gross substitutes valuations
- On monotone strategy equilibria in simultaneous auctions for complementary goods
- Multi-object auctions with resale: theory and experiment
- Incentive compatible mulit-unit combinatorial auctions: a primal dual approach
- Mechanisms for a spatially distributed market
- Dividing bads under additive utilities
- A multi-attribute e-auction mechanism for procurement: theoretical foundations
- Why votes have value: instrumental voting with overconfidence and overestimation of others' errors
- Enabling assisted strategic negotiations in actual-world procurement scenarios
- Greedy algorithm for the general multidimensional knapsack problem
- Combinatorial auctions
- Data dependent worst case bounds for weighted set packing
- Heuristics for a bidding problem
- The communication requirements of efficient allocations and supporting prices
- A formulation of combinatorial auction via reverse convex programming
- A constraint programming approach to extract the maximum number of non-overlapping test forms
- Combinatorial auctions with decreasing marginal utilities
- Collaborating freight forwarding enterprises
- 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
- 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
- Location-based techniques for the synergy approximation in combinatorial transportation auctions
- 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
- Capping methods for the automatic configuration of optimization algorithms
- An exact method for the combinatorial bids generation problem with uncertainty on clearing prices, bids success, and contracts materialization
- Computationally manageable combinational auctions
- Automated design of revenue-maximizing combinatorial auctions
- Metaheuristic approaches for the winner determination problem in combinatorial auction
- Distributed submodular maximization
- An exact rational mixed-integer programming solver
- An effective discrete dynamic convexized method for solving the winner determination problem
- On bidding algorithms for a distributed combinatorial auction
- Combinatorial auction design
- Iterative Combinatorial Auctions with Bidder-Determined Combinations
- On the determination of European day ahead electricity prices: the Turkish case
- 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
- Design of combinatorial auctions
- An interactive approach for bi-attribute multi-item auctions
- Iterative auction design for tree valuations
- Combinatorial auctions
- Optimality and Efficiency in Auctions Design: A Survey
- Approximation algorithms for combinatorial auctions with complement-free bidders
- Combinatorial Auctions with Verification Are Tractable
- Combinatorial auctions. Foreword by Vernon L. Smith.
- Alternative formulations for the set packing problem and their application to the winner determination problem
- The freight allocation problem with lane cost balancing constraint
- scientific article; zbMATH DE number 1748494 (Why is no real title available?)
- On the Economic Efficiency of the Combinatorial Clock Auction
- A combinatorial auction improves school meals in Chile: a case of OR in developing countries
- Modeling profit sharing in combinatorial exchanges by network flows
- A branch and cut solver for the maximum stable set problem
- Product-mix auctions and tropical geometry
- Dual relaxations of the time-indexed ILP formulation for min-sum scheduling problems
- Solving multi-mode resource-constrained multi-project scheduling problem with combinatorial auction mechanisms
- Reverse auction-based job assignment among foundry fabs
- Combinatorial auction design
- Approximation of Walrasian equilibrium in single-minded auctions
- Modeling the Pre Auction Stage The Truckload Case
- Bayesian Combinatorial Auctions
- Request evaluation strategies for carriers in auction-based collaborations
- 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
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)
