Pages that link to "Item:Q3581408"
From MaRDI portal
The following pages link to Approximation algorithms for combinatorial auctions with complement-free bidders (Q3581408):
Displaying 32 items.
- Geometric rounding: A dependent randomized rounding scheme (Q411220) (← links)
- Maximizing a class of submodular utility functions with constraints (Q517299) (← links)
- Maximizing a class of submodular utility functions (Q543403) (← links)
- Inapproximability results for combinatorial auctions with submodular utility functions (Q943868) (← links)
- Truthful mechanisms for two-range-values variant of unrelated scheduling (Q1019737) (← links)
- A lower bound for scheduling mechanisms (Q1031874) (← links)
- Best-response dynamics in combinatorial auctions with item bidding (Q2155910) (← links)
- Optimal item pricing in online combinatorial auctions (Q2164686) (← links)
- Quality of local equilibria in discrete exchange economies (Q2178594) (← links)
- Improved prophet inequalities for combinatorial welfare maximization with (approximately) subadditive agents (Q2237895) (← links)
- Optimization with demand oracles (Q2414860) (← links)
- Limitations of VCG-based mechanisms (Q2454572) (← links)
- Combinatorial auctions with decreasing marginal utilities (Q2506310) (← links)
- Truthful approximation mechanisms for restricted combinatorial auctions (Q2519488) (← links)
- Fair allocation of indivisible goods: beyond additive valuations (Q2667816) (← links)
- Cost sharing in two-sided markets (Q2670930) (← links)
- Expected time complexity of the auction algorithm and the push relabel algorithm for maximum bipartite matching on random graphs (Q2795749) (← links)
- Approximation algorithms for a winner determination problem of single-item multi-unit auctions (Q2843172) (← links)
- On bidding algorithms for a distributed combinatorial auction (Q3107969) (← links)
- Single-Parameter Combinatorial Auctions with Partially Public Valuations (Q3162522) (← links)
- Approximation Algorithms for Combinatorial Auctions with Complement-Free Bidders (Q3169079) (← links)
- Oblivious Medians Via Online Bidding (Q3525769) (← links)
- Approximation Algorithms for k-Duplicates Combinatorial Auctions with Subadditive Bidders (Q3611968) (← links)
- Inapproximability of Truthful Mechanisms via Generalizations of the Vapnik--Chervonenkis Dimension (Q4602545) (← links)
- An Efficient Winner Approximation for a Series of Combinatorial Auctions (Q4932630) (← links)
- Breaking the Logarithmic Barrier for Truthful Combinatorial Auctions with Submodular Bidders (Q4997307) (← links)
- Note on an Auction Procedure for a Matching Game in Polynomial Time (Q5434416) (← links)
- (Q5743455) (← links)
- (Q5874555) (← links)
- Truthful randomized mechanisms for combinatorial auctions (Q5891528) (← links)
- Maximize liquid welfare in combinatorial auctions with monotone valuations (Q6542876) (← links)
- Optimal item pricing in online combinatorial auctions (Q6589756) (← links)