Combinatorial Auctions: A Survey

From MaRDI portal
Revision as of 19:31, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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




Related Items (only showing first 100 items - show all)

A linear time algorithm to compute a maximum weighted independent set on cocomparability graphsA sampling-based stochastic winner determination model for truckload service procurementEmerging multiple issue e-auctionsSolving the set packing problem via a maximum weighted independent set heuristicA hybrid ant colony algorithm for the winner determination problemBundling equilibrium in combinatorial auctionsA new bidding framework for combinatorial e-auctionsAuctions with bidder-determined allowable combinationsLocation-based techniques for the synergy approximation in combinatorial transportation auctionsAn effective discrete dynamic convexized method for solving the winner determination problemOn the determination of European day ahead electricity prices: the Turkish caseHeuristic algorithms for visiting the customers in a rolling schedule environmentPricing combinatorial auctions by a set of linear price vectorsIterative Auction Design for Tree ValuationsMechanisms for a spatially distributed marketA Pareto-metaheuristic for a bi-objective winner determination problem in a combinatorial reverse auctionA pricing scheme for combinatorial auctions based on bundle sizesAn interactive approach for bi-attribute multi-item auctionsAlternative solution algorithm for winner determination problem with quantity discount of transportation service procurementAscending price Vickrey auctions for general valuationsAlternative formulations for the set packing problem and their application to the winner determination problemCapping methods for the automatic configuration of optimization algorithmsDiscrete location for bundled demand pointsDividing bads under additive utilitiesAn exact method for the combinatorial bids generation problem with uncertainty on clearing prices, bids success, and contracts materializationCoordination of manufacturing and engineering activities during product transitionsLocal branching relaxation heuristics for integer linear programsA combinatorial auction‐based approach for ridesharing in a student transportation systemSolving the winner determination problem in combinatorial auctions for fractional ownership of autonomous vehiclesAn iterative combinatorial auction design for fractional ownership of autonomous vehiclesProduct-Mix Auctions and Tropical GeometryWinner determination in geometrical combinatorial auctionsA multi-attribute e-auction mechanism for procurement: theoretical foundationsThe freight allocation problem with lane cost balancing constraintWhy votes have value: instrumental voting with overconfidence and overestimation of others' errorsPricing in multiple-item procurement auctions with a common to all items fixed costModeling profit sharing in combinatorial exchanges by network flowsA branch and cut solver for the maximum stable set problemWalrasian equilibrium: Hardness, approximations and tractable instancesEnabling assisted strategic negotiations in actual-world procurement scenariosAn Exact Rational Mixed-Integer Programming SolverAn optimal multiprocessor combinatorial auction solverA model and heuristic algorithms for multi-unit nondiscriminatory combinatorial auctionDual relaxations of the time-indexed ILP formulation for min-sum scheduling problemsExact algorithms for the matrix bid auctionGreedy algorithm for the general multidimensional knapsack problemCombinatorial auctionsSolving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection methodProblem reduction heuristic for the \(0\)-\(1\) multidimensional knapsack problemData dependent worst case bounds for weighted set packingSimple combinatorial auctions with budget constraintsOn complexity of single-minded auctionHeuristics for a bidding problemOptimal RSUs placement with delay bounded message dissemination in vehicular networksDesign for optimized multi-lateral multi-commodity marketsPricing and clearing combinatorial markets with singleton and swap orders. Efficient algorithms for the futures opening auction problemApproximation of Walrasian equilibrium in single-minded auctionsStochastic set packing problemThe communication requirements of efficient allocations and supporting pricesComputer science and decision theoryReverse auction-based job assignment among foundry fabsCompact bidding languages and supplier selection for markets with economies of scale and scopeA polyhedral study on 0-1 knapsack problems with set packing constraintsA constraint programming approach to extract the maximum number of non-overlapping test formsCombinatorial auctions with decreasing marginal utilitiesCollaborating freight forwarding enterprisesMulti-attribute online reverse auctions: recent research trendsGeometry of gross substitutes valuationsOn monotone strategy equilibria in simultaneous auctions for complementary goodsFoundations of mechanism design: a tutorial. I. Key concepts and classical resultsFoundations of mechanism design: a tutorial. II. Advanced concepts and resultsA new pricing scheme based on DEA for iterative multi-unit combinatorial auctionsRequest evaluation strategies for carriers in auction-based collaborationsThe stochastic bid generation problem in combinatorial transportation auctionsA fast approximation algorithm for solving the complete set packing problemTruthful approximation mechanisms for restricted combinatorial auctionsAn optimization approach for winner determination problem considering transportation cost discountsA multi-unit tender award process: The case of TransantiagoA hybrid branch-and-bound approach for exact rational mixed-integer programmingA double-sided multiunit combinatorial auction for substitutes: Theory and algorithmsThe new treatment mode research of hepatitis B based on ant colony algorithmSAT encodings for pseudo-Boolean constraints together with at-most-one constraintsBlock order restrictions in combinatorial electric energy auctionsExploring the VCG mechanism in combinatorial auctions: the threshold revenue and the threshold-price ruleNon-linear anonymous pricing combinatorial auctionsAllocative efficiency in simulated multiple-unit combinatorial auctions with quantity supportMarket-based pricing in grids: on strategic manipulation and computational costModeling the Pre Auction Stage The Truckload CaseCombinatorial auctions for electronic businessAllocation of advertising space by a web service provider using combinatorial auctionsBid evaluation in procurement auctions with piecewise linear supply curvesConflict and competition over multi-issuesMulti-object auctions with resale: theory and experimentMetaheuristic Approaches for the Winner Determination Problem in Combinatorial AuctionIncentive compatible mulit-unit combinatorial auctions: a primal dual approachUnnamed ItemIterative Dutch combinatorial auctionsUsed car salesman problem: a differential auction-barter marketSolving Multi-Mode Resource-Constrained Multi-Project Scheduling Problem with Combinatorial Auction MechanismsComparison of four mechanisms for request exchange in collaborative transportation







This page was built for publication: Combinatorial Auctions: A Survey