The following pages link to Combinatorial auctions: a survey (Q2884560):
Displaying 50 items.
- Simple combinatorial auctions with budget constraints (Q2006772) (← links)
- Optimal RSUs placement with delay bounded message dissemination in vehicular networks (Q2012886) (← links)
- Pricing and clearing combinatorial markets with singleton and swap orders. Efficient algorithms for the futures opening auction problem (Q2014365) (← links)
- An optimization approach for winner determination problem considering transportation cost discounts (Q2046272) (← links)
- The new treatment mode research of hepatitis B based on ant colony algorithm (Q2060050) (← links)
- SAT encodings for pseudo-Boolean constraints together with at-most-one constraints (Q2060735) (← links)
- Conflict and competition over multi-issues (Q2098941) (← links)
- A hybrid ant colony algorithm for the winner determination problem (Q2130382) (← links)
- Alternative solution algorithm for winner determination problem with quantity discount of transportation service procurement (Q2164069) (← links)
- Computer science and decision theory (Q2271874) (← links)
- Compact bidding languages and supplier selection for markets with economies of scale and scope (Q2275626) (← links)
- Geometry of gross substitutes valuations (Q2283101) (← links)
- On monotone strategy equilibria in simultaneous auctions for complementary goods (Q2283142) (← links)
- Multi-object auctions with resale: theory and experiment (Q2345231) (← links)
- Incentive compatible mulit-unit combinatorial auctions: a primal dual approach (Q2345944) (← links)
- Mechanisms for a spatially distributed market (Q2389294) (← links)
- Dividing bads under additive utilities (Q2417409) (← links)
- A multi-attribute e-auction mechanism for procurement: theoretical foundations (Q2432837) (← links)
- Why votes have value: instrumental voting with overconfidence and overestimation of others' errors (Q2442822) (← links)
- Enabling assisted strategic negotiations in actual-world procurement scenarios (Q2466387) (← links)
- Greedy algorithm for the general multidimensional knapsack problem (Q2480198) (← links)
- Combinatorial auctions (Q2480257) (← links)
- Data dependent worst case bounds for weighted set packing (Q2484341) (← links)
- Heuristics for a bidding problem (Q2489281) (← links)
- The communication requirements of efficient allocations and supporting prices (Q2496786) (← links)
- A formulation of combinatorial auction via reverse convex programming (Q2498233) (← links)
- A constraint programming approach to extract the maximum number of non-overlapping test forms (Q2506175) (← links)
- Combinatorial auctions with decreasing marginal utilities (Q2506310) (← links)
- Collaborating freight forwarding enterprises (Q2507568) (← links)
- The stochastic bid generation problem in combinatorial transportation auctions (Q2514752) (← links)
- A fast approximation algorithm for solving the complete set packing problem (Q2514810) (← links)
- Truthful approximation mechanisms for restricted combinatorial auctions (Q2519488) (← links)
- Combinatorial auctions for electronic business (Q2571439) (← links)
- Allocation of advertising space by a web service provider using combinatorial auctions (Q2571440) (← links)
- Bid evaluation in procurement auctions with piecewise linear supply curves (Q2573006) (← links)
- Location-based techniques for the synergy approximation in combinatorial transportation auctions (Q2629915) (← links)
- Capping methods for the automatic configuration of optimization algorithms (Q2669790) (← links)
- An exact method for the combinatorial bids generation problem with uncertainty on clearing prices, bids success, and contracts materialization (Q2676381) (← links)
- Computationally manageable combinational auctions (Q2784019) (← links)
- Automated design of revenue-maximizing combinatorial auctions (Q2795862) (← links)
- Metaheuristic Approaches for the Winner Determination Problem in Combinatorial Auction (Q2866140) (← links)
- (Q2958605) (← links)
- An Exact Rational Mixed-Integer Programming Solver (Q3009754) (← links)
- On bidding algorithms for a distributed combinatorial auction (Q3107969) (← links)
- Combinatorial Auction Design (Q3114876) (← links)
- Iterative Combinatorial Auctions with Bidder-Determined Combinations (Q3115458) (← links)
- Iterative Auction Design for Tree Valuations (Q3465578) (← links)
- Approximation algorithms for combinatorial auctions with complement-free bidders (Q3581408) (← links)
- Combinatorial Auctions with Verification Are Tractable (Q3586382) (← links)
- On the Economic Efficiency of the Combinatorial Clock Auction (Q4575680) (← links)
