Pages that link to "Item:Q5958538"
From MaRDI portal
The following pages link to Algorithm for optimal winner determination in combinatorial auctions (Q5958538):
Displaying 50 items.
- Constrained multi-object auctions and \(b\)-matching (Q294790) (← links)
- An effective discrete dynamic convexized method for solving the winner determination problem (Q306103) (← links)
- Optimal bidding in auctions from a game theory perspective (Q320681) (← links)
- An interactive approach for bi-attribute multi-item auctions (Q342785) (← links)
- Computing optimal outcomes under an expressive representation of settings with externalities (Q414842) (← links)
- Information-theoretic approaches to branching in search (Q429675) (← links)
- The clock proxy auction for allocating radio spectrum licenses (Q535369) (← links)
- Permutation betting markets: singleton betting with extra information (Q547299) (← links)
- Comparing multiagent systems research in combinatorial auctions and voting (Q616771) (← links)
- Expressive markets for donating to charities (Q646531) (← links)
- Iterative Dutch combinatorial auctions (Q812381) (← links)
- BOB: Improved winner determination in combinatorial auctions and generalizations (Q814442) (← links)
- Average-case analysis of best-first search in two representative directed acyclic graphs (Q814592) (← links)
- Computing leximin-optimal solutions in constraint networks (Q835811) (← links)
- An options-based solution to the sequential auction problem (Q835835) (← links)
- Coalition structure generation: a survey (Q900307) (← links)
- A hybrid exact algorithm for complete set partitioning (Q901033) (← links)
- The complexity of deciding reachability properties of distributed negotiation schemes (Q924139) (← links)
- Exact methods for combinatorial auctions. (Abstract of Thesis) (Q926565) (← links)
- Inapproximability results for combinatorial auctions with submodular utility functions (Q943868) (← links)
- A model and heuristic algorithms for multi-unit nondiscriminatory combinatorial auction (Q947956) (← links)
- Exact algorithms for the matrix bid auction (Q958442) (← links)
- An abstraction-refinement methodology for reasoning about network games (Q1630443) (← links)
- Winner determination in geometrical combinatorial auctions (Q1698906) (← links)
- Accelerating exact and approximate inference for (distributed) discrete optimization with GPUs (Q1706596) (← links)
- PUSH: A generalized operator for the maximum vertex weight clique problem (Q1752768) (← links)
- Emerging multiple issue e-auctions (Q1876154) (← links)
- Fair imposition (Q1886294) (← links)
- Distributed algorithms for matching in hypergraphs (Q2117684) (← links)
- Multiagent resource allocation in \(k\)-additive domains: preference representation and complexity (Q2271865) (← links)
- Computer science and decision theory (Q2271874) (← links)
- An information-theoretic framework for the lossy compression of link streams (Q2285125) (← links)
- Look-ahead strategies for dynamic pickup and delivery problems (Q2379663) (← links)
- Influence of non-price and environmental sustainability factors on truckload procurement process (Q2404315) (← links)
- A taxonomy of exact methods for partial Max-SAT (Q2434567) (← links)
- Limitations of VCG-based mechanisms (Q2454572) (← links)
- Enabling assisted strategic negotiations in actual-world procurement scenarios (Q2466387) (← links)
- Trading grid services - a multi-attribute combinatorial approach (Q2467246) (← links)
- Combinatorial auctions (Q2480257) (← links)
- Data dependent worst case bounds for weighted set packing (Q2484341) (← links)
- Heuristics for a bidding problem (Q2489281) (← links)
- Multiple unit auctions with economies and diseconomies of scale (Q2503057) (← links)
- Side constraints and non-price attributes in markets (Q2506312) (← 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)
- Strong activity rules for iterative combinatorial auctions (Q2655643) (← links)
- Automated Design of Revenue-Maximizing Combinatorial Auctions (Q2795862) (← links)
- Metaheuristic Approaches for the Winner Determination Problem in Combinatorial Auction (Q2866140) (← links)
- Optimal Allocation in Combinatorial Auctions with Quadratic Utility Functions (Q3010396) (← links)