The following pages link to Combinatorial Auctions: A Survey (Q2884560):
Displaying 50 items.
- A linear time algorithm to compute a maximum weighted independent set on cocomparability graphs (Q264186) (← links)
- A sampling-based stochastic winner determination model for truckload service procurement (Q264290) (← links)
- An effective discrete dynamic convexized method for solving the winner determination problem (Q306103) (← links)
- On the determination of European day ahead electricity prices: the Turkish case (Q319508) (← links)
- Pricing combinatorial auctions by a set of linear price vectors (Q331786) (← links)
- A Pareto-metaheuristic for a bi-objective winner determination problem in a combinatorial reverse auction (Q336792) (← links)
- An interactive approach for bi-attribute multi-item auctions (Q342785) (← links)
- Alternative formulations for the set packing problem and their application to the winner determination problem (Q367639) (← links)
- The freight allocation problem with lane cost balancing constraint (Q439318) (← links)
- Modeling profit sharing in combinatorial exchanges by network flows (Q490193) (← links)
- A branch and cut solver for the maximum stable set problem (Q491210) (← links)
- Dual relaxations of the time-indexed ILP formulation for min-sum scheduling problems (Q513629) (← links)
- Approximation of Walrasian equilibrium in single-minded auctions (Q557845) (← links)
- Discrete location for bundled demand points (Q611011) (← links)
- Design for optimized multi-lateral multi-commodity markets (Q706897) (← links)
- Stochastic set packing problem (Q713096) (← links)
- Multi-attribute online reverse auctions: recent research trends (Q726211) (← links)
- A hybrid branch-and-bound approach for exact rational mixed-integer programming (Q744213) (← links)
- Iterative Dutch combinatorial auctions (Q812381) (← links)
- Used car salesman problem: a differential auction-barter market (Q812388) (← links)
- Solving the set packing problem via a maximum weighted independent set heuristic (Q826368) (← links)
- Heuristic algorithms for visiting the customers in a rolling schedule environment (Q850656) (← links)
- Ascending price Vickrey auctions for general valuations (Q869869) (← links)
- Pricing in multiple-item procurement auctions with a common to all items fixed cost (Q928048) (← links)
- Walrasian equilibrium: Hardness, approximations and tractable instances (Q943867) (← links)
- An optimal multiprocessor combinatorial auction solver (Q947953) (← links)
- A model and heuristic algorithms for multi-unit nondiscriminatory combinatorial auction (Q947956) (← links)
- Exact algorithms for the matrix bid auction (Q958442) (← links)
- Foundations of mechanism design: a tutorial. I. Key concepts and classical results (Q1001137) (← links)
- Foundations of mechanism design: a tutorial. II. Advanced concepts and results (Q1001138) (← links)
- A new pricing scheme based on DEA for iterative multi-unit combinatorial auctions (Q1001362) (← links)
- A multi-unit tender award process: The case of Transantiago (Q1011301) (← links)
- A double-sided multiunit combinatorial auction for substitutes: Theory and algorithms (Q1015002) (← links)
- Block order restrictions in combinatorial electric energy auctions (Q1041986) (← links)
- Exploring the VCG mechanism in combinatorial auctions: the threshold revenue and the threshold-price rule (Q1042133) (← links)
- Non-linear anonymous pricing combinatorial auctions (Q1042137) (← links)
- Allocative efficiency in simulated multiple-unit combinatorial auctions with quantity support (Q1043359) (← links)
- Market-based pricing in grids: on strategic manipulation and computational cost (Q1046122) (← links)
- A pricing scheme for combinatorial auctions based on bundle sizes (Q1651618) (← links)
- Winner determination in geometrical combinatorial auctions (Q1698906) (← links)
- Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method (Q1761134) (← links)
- Problem reduction heuristic for the \(0\)-\(1\) multidimensional knapsack problem (Q1761939) (← links)
- On complexity of single-minded auction (Q1765304) (← links)
- A polyhedral study on 0-1 knapsack problems with set packing constraints (Q1785756) (← links)
- Emerging multiple issue e-auctions (Q1876154) (← links)
- Bundling equilibrium in combinatorial auctions (Q1885427) (← links)
- A new bidding framework for combinatorial e-auctions (Q1885976) (← links)
- Auctions with bidder-determined allowable combinations (Q1887929) (← links)
- Simple combinatorial auctions with budget constraints (Q2006772) (← links)
- Optimal RSUs placement with delay bounded message dissemination in vehicular networks (Q2012886) (← links)
