Computationally Manageable Combinational Auctions
From MaRDI portal
Publication:2784019
DOI10.1287/mnsc.44.8.1131zbMath0989.90094OpenAlexW2163675995WikidataQ30048672 ScholiaQ30048672MaRDI QIDQ2784019
Ronald M. Harstad, Michael H. Rothkopf, Aleksandar Saša Pekeč
Publication date: 17 April 2002
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.44.8.1131
computational complexitycombinatorial auctionsspectrum auctionsbidding with synergiesmulti-item simultaneous auctions
Search theory (90B40) Management decision making, including multiple objectives (90B50) Complexity and performance of numerical algorithms (65Y20)
Related Items
A sampling-based stochastic winner determination model for truckload service procurement ⋮ Tractable combinatorial auctions and \(b\)-matching ⋮ Emerging multiple issue e-auctions ⋮ Incentive-compatible simple mechanisms ⋮ Solving the machine-loading problem in a flexible manufacturing system using a combinatorial auction-based approach ⋮ Distributed scheduling: a review of concepts and applications ⋮ A hybrid ant colony algorithm for the winner determination problem ⋮ Bundling equilibrium in combinatorial auctions ⋮ A column generation approach to the coalition formation problem in multi-agent systems ⋮ A new bidding framework for combinatorial e-auctions ⋮ Constrained multi-object auctions and \(b\)-matching ⋮ An options-based solution to the sequential auction problem ⋮ Models for bundle trading in financial markets ⋮ Auctions with bidder-determined allowable combinations ⋮ An effective discrete dynamic convexized method for solving the winner determination problem ⋮ Auction-based distributed scheduling in a dynamic job shop environment ⋮ A Lagrangian approach to the winner determination problem in iterative combinatorial reverse auctions ⋮ Regret in auctions: theory and evidence ⋮ Multi-criteria auctions without full comparability of bids ⋮ Shapley value based pricing for auctions and exchanges ⋮ A flexible model for tree-structured multi-commodity markets ⋮ Distributed fair allocation of indivisible goods ⋮ Vickrey-Dutch procurement auction for multiple items ⋮ Ascending price Vickrey auctions for general valuations ⋮ Alternative formulations for the set packing problem and their application to the winner determination problem ⋮ Comparing multiagent systems research in combinatorial auctions and voting ⋮ Solving the winner determination problem in combinatorial auctions for fractional ownership of autonomous vehicles ⋮ An equilibrium analysis of the simultaneous ascending auction ⋮ Computing optimal outcomes under an expressive representation of settings with externalities ⋮ A hybrid exact algorithm for complete set partitioning ⋮ A characterization of the existence of succinct linear representation of subset-valuations ⋮ Auctions with synergy and resale ⋮ Winner determination in geometrical combinatorial auctions ⋮ The cross-entropy method for the winner determination problem in combinatorial auctions ⋮ Pricing combinatorial auctions. ⋮ The effect of false-name bids in combinatorial auctions: new fraud in internet auctions. ⋮ Expressive markets for donating to charities ⋮ Computationally-feasible truthful auctions for convex bundles ⋮ Optimal pricing in iterative flexible combinatorial procurement auctions ⋮ Enabling assisted strategic negotiations in actual-world procurement scenarios ⋮ Trading grid services - a multi-attribute combinatorial approach ⋮ An optimal multiprocessor combinatorial auction solver ⋮ A model and heuristic algorithms for multi-unit nondiscriminatory combinatorial auction ⋮ A REVIEW OF TREE CONVEX SETS TEST ⋮ Supplier selection by coupling-attribute combinatorial analysis ⋮ Exact algorithms for the matrix bid auction ⋮ Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem ⋮ A market-based multi-agent system model for decentralized multi-project scheduling ⋮ Combinatorial auctions ⋮ Anytime coalition structure generation in multi-agent systems with positive or negative externalities ⋮ Problem reduction heuristic for the \(0\)-\(1\) multidimensional knapsack problem ⋮ Algorithmic mechanism design ⋮ Auction protocols for decentralized scheduling ⋮ A parametrization of the auction design space ⋮ Design for optimized multi-lateral multi-commodity markets ⋮ Solving the combinatorial double auction problem ⋮ On the robustness of non-linear personalized price combinatorial auctions ⋮ Robust combinatorial auction protocol against false-name bids ⋮ Multi-object auctions with package bidding: an experimental comparison of Vickrey and iBEA ⋮ The communication requirements of efficient allocations and supporting prices ⋮ Multiagent resource allocation in \(k\)-additive domains: preference representation and complexity ⋮ Computer science and decision theory ⋮ Combinatorial clock auctions: price direction and performance ⋮ Auction-based approach to resolve the scheduling problem in the steel making process ⋮ Optimal pricing of capacitated networks ⋮ Multi-unit auctions with complementarities: issues of efficiency in electricity auctions ⋮ Abstracting and Verifying Strategy-Proofness for Auction Mechanisms ⋮ Multiple unit auctions with economies and diseconomies of scale ⋮ Combinatorial auctions with decreasing marginal utilities ⋮ Side constraints and non-price attributes in markets ⋮ Hierarchical package bidding: a paper \& pencil combinatorial auction ⋮ Algorithm for optimal winner determination in combinatorial auctions ⋮ Automated Design of Revenue-Maximizing Combinatorial Auctions ⋮ An information-theoretic framework for the lossy compression of link streams ⋮ A fast approximation algorithm for solving the complete set packing problem ⋮ Convexity and Solutions of Stochastic Multidimensional 0-1 Knapsack Problems with Probabilistic Constraints ⋮ Combinatorial auction design ⋮ Solving multiple scenarios in a combinatorial auction ⋮ Efficiently Generating k-Best Solutions to Procurement Auctions ⋮ The new treatment mode research of hepatitis B based on ant colony algorithm ⋮ Algorithms as Mechanisms: The Price of Anarchy of Relax and Round ⋮ 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 ⋮ Combinatorial auctions for electronic business ⋮ Metaheuristic Approaches for the Winner Determination Problem in Combinatorial Auction ⋮ Incentive compatible mulit-unit combinatorial auctions: a primal dual approach ⋮ Combinatorial voter control in elections ⋮ Iterative Dutch combinatorial auctions ⋮ BOB: Improved winner determination in combinatorial auctions and generalizations ⋮ Multi-unit demand auctions with synergies: behavior in sealed-bid versus ascending-bid uniform-price auctions ⋮ Performance evaluation of multi-object auctions ⋮ Anytime coalition structure generation: an average case study ⋮ Solving Multi-Mode Resource-Constrained Multi-Project Scheduling Problem with Combinatorial Auction Mechanisms
