Approximation algorithms for combinatorial auctions with complement-free bidders
From MaRDI portal
Publication:3169079
Recommendations
- Approximation algorithms for combinatorial auctions with complement-free bidders
- Approximation Algorithms for k-Duplicates Combinatorial Auctions with Subadditive Bidders
- Inapproximability results for combinatorial auctions with submodular utility functions
- Bayesian combinatorial auctions
- Combinatorial auctions with decreasing marginal utilities
Cited in
(44)- Inapproximability results for combinatorial auctions with submodular utility functions
- scientific article; zbMATH DE number 7651150 (Why is no real title available?)
- Combinatorial auctions with interdependent valuations: SOS to the rescue
- Improved maximin guarantees for subadditive and fractionally subadditive fair allocation problem
- A generic truthful mechanism for combinatorial auctions
- Oblivious Medians Via Online Bidding
- On the computational power of demand queries
- When are welfare guarantees robust?
- On the complexity of computing an equilibrium in combinatorial auctions
- On the efficiency of the proportional allocation mechanism for divisible resources
- Bayesian combinatorial auctions
- Separating the communication complexity of truthful and nontruthful algorithms for combinatorial auctions
- A simple and approximately optimal mechanism for a buyer with complements
- Envy-free revenue approximation for asymmetric buyers with budgets
- Online submodular welfare maximization: greedy beats 1/2 in random order
- Expected time complexity of the auction algorithm and the push relabel algorithm for maximum bipartite matching on random graphs
- On envy-free revenue approximation for combinatorial buyers with budgets
- An Experimental Study of the Misdirection Algorithm for Combinatorial Auctions
- An Efficient Winner Approximation for a Series of Combinatorial Auctions
- On bidding algorithms for a distributed combinatorial auction
- Approximating Nash social welfare under binary XOS and binary subadditive valuations
- Learning in auctions: regret is hard, envy is easy
- On the Efficiency of the Proportional Allocation Mechanism for Divisible Resources
- On simultaneous two-player combinatorial auctions
- Approximation algorithms for a winner determination problem of single-item multi-unit auctions
- Lower bounds for approximating graph parameters via communication complexity
- A new approximation guarantee for monotone submodular function maximization via discrete convexity
- Welfare maximization with friends-of-friends network externalities
- Fractionally Subadditive Maximization under an Incremental Knapsack Constraint with Applications to Incremental Flows
- Prophet secretary for combinatorial auctions and matroids
- Combinatorial auctions with decreasing marginal utilities
- Computing stable coalitions: approximation algorithms for reward sharing
- Sketching valuation functions
- Approximating Nash social welfare by matching and local search
- Approximation algorithms for combinatorial auctions with complement-free bidders
- Combinatorial auctions with conflict-based externalities
- Approximation Algorithms for k-Duplicates Combinatorial Auctions with Subadditive Bidders
- Bayesian optimal knapsack procurement
- Worst-case mechanism design via Bayesian analysis
- Communication complexity of discrete fair division
- Setting lower bounds on truthfulness
- Two-stage submodular maximization under knapsack and matroid constraints
- Maximize liquid welfare in combinatorial auctions with monotone valuations
- A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation
This page was built for publication: Approximation algorithms for combinatorial auctions with complement-free bidders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3169079)
