Computationally manageable combinational auctions
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Solving multiple scenarios in a combinatorial auction
- 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
- Decentralized computation procurement and computational robustness in a smart market
- Auctions as algorithms. Computerized trade execution and price discovery
- Pricing combinatorial auctions.
- The effect of false-name bids in combinatorial auctions: new fraud in internet auctions.
- Tractable combinatorial auctions and \(b\)-matching
- Shapley value based pricing for auctions and exchanges
- Winner determination in geometrical combinatorial auctions
- Optimal pricing in iterative flexible combinatorial procurement auctions
- Anytime coalition structure generation in multi-agent systems with positive or negative externalities
- Problem reduction heuristic for the 0-1 multidimensional knapsack problem
- Multi-unit auctions with complementarities: issues of efficiency in electricity auctions
- Emerging multiple issue e-auctions
- 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
- Models for bundle trading in financial markets
- Auctions with bidder-determined allowable combinations
- Supplier selection by coupling-attribute combinatorial analysis
- The new treatment mode research of hepatitis B based on ant colony algorithm
- A hybrid ant colony algorithm for the winner determination problem
- The cross-entropy method for the winner determination problem in combinatorial auctions
- Multi-object auctions with package bidding: an experimental comparison of Vickrey and iBEA
- Multiagent resource allocation in k-additive domains: preference representation and complexity
- Computer science and decision theory
- Combinatorial clock auctions: price direction and performance
- An information-theoretic framework for the lossy compression of link streams
- Incentive compatible mulit-unit combinatorial auctions: a primal dual approach
- Combinatorial voter control in elections
- Enabling assisted strategic negotiations in actual-world procurement scenarios
- Trading grid services - a multi-attribute combinatorial approach
- A market-based multi-agent system model for decentralized multi-project scheduling
- Combinatorial auctions
- The communication requirements of efficient allocations and supporting prices
- Multiple unit auctions with economies and diseconomies of scale
- Combinatorial auctions with decreasing marginal utilities
- Side constraints and non-price attributes in markets
- A fast approximation algorithm for solving the complete set packing problem
- Combinatorial auctions for electronic business
- Regret in auctions: theory and evidence
- A sampling-based stochastic winner determination model for truckload service procurement
- Strong activity rules for iterative combinatorial auctions
- Automated design of revenue-maximizing combinatorial auctions
- Convexity and solutions of stochastic multidimensional 0-1 knapsack problems with probabilistic constraints
- Metaheuristic approaches for the winner determination problem in combinatorial auction
- Combinatorial auctions: a survey
- Constrained multi-object auctions and b-matching
- An effective discrete dynamic convexized method for solving the winner determination problem
- Combinatorial auction design
- A branch-and-price algorithm and new test problems for spectrum auctions
- A new and improved design for multiobject iterative auctions
- A combinatorial auction with multiple winners for universal service
- Handbook of spectrum auction design
- Solving the machine-loading problem in a flexible manufacturing system using a combinatorial auction-based approach
- Distributed scheduling: a review of concepts and applications
- Co-evolutionary agents in combinatorial sealed-bid auctions for spectrum licenses markets
- A Lagrangian approach to the winner determination problem in iterative combinatorial reverse auctions
- Design of combinatorial auctions
- Distributed fair allocation of indivisible goods
- Combinatorial Auctions with Verification Are Tractable
- A New Analysis of Expected Revenue
- Abstracting and Verifying Strategy-Proofness for Auction Mechanisms
- Efficiently Generating k-Best Solutions to Procurement Auctions
- Alternative formulations for the set packing problem and their application to the winner determination problem
- An equilibrium analysis of the simultaneous ascending auction
- Computing optimal outcomes under an expressive representation of settings with externalities
- Auctions with synergy and resale
- scientific article; zbMATH DE number 2065154 (Why is no real title available?)
- scientific article; zbMATH DE number 2080503 (Why is no real title available?)
- Quadratic core-selecting payment rules for combinatorial auctions
- A review of tree convex sets test
- Anytime coalition structure generation: an average case study
- Auction-based distributed scheduling in a dynamic job shop environment
- Algorithms as mechanisms: the price of anarchy of relax and round
- Solving multi-mode resource-constrained multi-project scheduling problem with combinatorial auction mechanisms
- Optimal pricing of capacitated networks
- Optimization issues in combinatorial auctions
- Auction-based approach to resolve the scheduling problem in the steel making process
- Combinatorial auction design
- Algorithmic mechanism design
- Auction protocols for decentralized scheduling
- A parametrization of the auction design space
- Robust combinatorial auction protocol against false-name bids
- Algorithm for optimal winner determination in combinatorial auctions
- Solving the winner determination problem in combinatorial auctions for fractional ownership of autonomous vehicles
- Comparing multiagent systems research in combinatorial auctions and voting
- A characterization of the existence of succinct linear representation of subset-valuations
- Expressive markets for donating to charities
- Forming an agreement between buyers of frequencies for open access at a spectrum auction
- The impact of partial production capacity sharing via production as a service
- Collective decision making
- Superadditive market games
- Approximation algorithm and mechanism design for bisubmodular welfare maximization problem
- Preference learning for efficient bundle selection in horizontal transport collaborations
- Design for optimized multi-lateral multi-commodity markets
- Solving the combinatorial double auction problem
- Random allocations of multiple objects with incomplete information
This page was built for publication: Computationally manageable combinational auctions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2784019)
