Combinatorial auctions: a survey
From MaRDI portal
Publication:2884560
Recommendations
Cited in
(only showing first 100 items - show all)- Capping methods for the automatic configuration of optimization algorithms
- Compact bidding languages and supplier selection for markets with economies of scale and scope
- Bundling equilibrium in combinatorial auctions
- Combinatorial Auctions with Verification Are Tractable
- Approximation algorithms for combinatorial auctions with complement-free bidders
- Allocative efficiency in simulated multiple-unit combinatorial auctions with quantity support
- Exact methods for combinatorial auctions. (Abstract of Thesis)
- Alternative formulations for the set packing problem and their application to the winner determination problem
- Winner determination in geometrical combinatorial auctions
- A multi-attribute e-auction mechanism for procurement: theoretical foundations
- 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
- A formulation of combinatorial auction via reverse convex programming
- Heuristics for a bidding problem
- Computer science and decision theory
- An exact rational mixed-integer programming solver
- scientific article; zbMATH DE number 1748494 (Why is no real title available?)
- Optimality and Efficiency in Auctions Design: A Survey
- Dual relaxations of the time-indexed ILP formulation for min-sum scheduling problems
- 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
- The stochastic bid generation problem in combinatorial transportation auctions
- On the Economic Efficiency of the Combinatorial Clock Auction
- Reverse auction-based job assignment among foundry fabs
- Solving the set packing problem via a maximum weighted independent set heuristic
- Incentive compatible mulit-unit combinatorial auctions: a primal dual approach
- A fast approximation algorithm for solving the complete set packing problem
- 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
- Optimal and Efficient Auctions for the Gradual Procurement of Strategic Service Provider Agents
- Combinatorial auctions
- The impact of partial production capacity sharing via production as a service
- Used car salesman problem: a differential auction-barter market
- Collaborative transportation for attended home deliveries
- Request evaluation strategies for carriers in auction-based collaborations
- The polyhedral geometry of truthful auctions
- Greedy algorithm for the general multidimensional knapsack problem
- Truthful approximation mechanisms for restricted combinatorial auctions
- Simple combinatorial auctions with budget constraints
- Design for optimized multi-lateral multi-commodity markets
- Solving multi-mode resource-constrained multi-project scheduling problem with combinatorial auction mechanisms
- Optimal RSUs placement with delay bounded message dissemination in vehicular networks
- 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 study of auction mechanisms for multilateral procurement based on subgradient and bundle methods
- Combinatorial auction design
- A new bidding framework for combinatorial e-auctions
- Pricing and clearing combinatorial markets with singleton and swap orders. Efficient algorithms for the futures opening auction problem
- A hybrid ant colony algorithm for the winner determination problem
- Stochastic set packing problem
- Why votes have value: instrumental voting with overconfidence and overestimation of others' errors
- Data dependent worst case bounds for weighted set packing
- A constraint programming approach to extract the maximum number of non-overlapping test forms
- Foundations of mechanism design: a tutorial. I. Key concepts and classical results
- Foundations of mechanism design: a tutorial. II. Advanced concepts and results
- Ascending price Vickrey auctions for general valuations
- Product-mix auctions and tropical geometry
- A combinatorial auction improves school meals in Chile: a case of OR in developing countries
- Enabling assisted strategic negotiations in actual-world procurement scenarios
- Allocation of advertising space by a web service provider using combinatorial auctions
- Coordination of manufacturing and engineering activities during product transitions
- Integrating production scheduling and transportation procurement through combinatorial auctions
- Bid evaluation in procurement auctions with piecewise linear supply curves
- An effective discrete dynamic convexized method for solving the winner determination problem
- On monotone strategy equilibria in simultaneous auctions for complementary goods
- A branch and cut solver for the maximum stable set problem
- Walrasian equilibrium: Hardness, approximations and tractable instances
- On the determination of European day ahead electricity prices: the Turkish case
- Mechanisms for a spatially distributed market
- Modeling the Pre Auction Stage The Truckload Case
- 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
- Combinatorial auctions for electronic business
- Combinatorial auction design
- Location-based techniques for the synergy approximation in combinatorial transportation auctions
- Discrete location for bundled demand points
- On bidding algorithms for a distributed combinatorial auction
- A hybrid branch-and-bound approach for exact rational mixed-integer programming
- The communication requirements of efficient allocations and supporting prices
- On complexity of single-minded auction
- A polyhedral study on 0-1 knapsack problems with set packing constraints
- A model and heuristic algorithms for multi-unit nondiscriminatory combinatorial auction
- Design of combinatorial auctions
- An iterative combinatorial auction design for fractional ownership of autonomous vehicles
- Solving the winner determination problem in combinatorial auctions for fractional ownership of autonomous vehicles
- Distributed submodular maximization
- Multi-object auctions with resale: theory and experiment
- 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
- Bayesian Combinatorial Auctions
- Iterative Combinatorial Auctions with Bidder-Determined Combinations
- Conflict and competition over multi-issues
- An optimization approach for winner determination problem considering transportation cost discounts
- Multi-attribute online reverse auctions: recent research trends
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)
