Approximation algorithms for combinatorial auctions with complement-free bidders

DOI10.1287/MOOR.1090.0436zbMATH Open1216.68338OpenAlexW2104334470MaRDI QIDQ3169079FDOQ3169079

Authors: Shahar Dobzinski, Noam Nisan, Michael Schapira 

Publication date: 27 April 2011

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.1090.0436

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

zbMATH Keywords

combinatorial auctionstruthfulness

Mathematics Subject Classification ID

Auctions, bargaining, bidding and selling, and other market models (91B26) Approximation algorithms (68W25)

Cited In (36)

• Title not available (Why is that?)
• Computing Stable Coalitions: Approximation Algorithms for Reward Sharing
• Inapproximability results for combinatorial auctions with submodular utility functions
• Improved maximin guarantees for subadditive and fractionally subadditive fair allocation problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Oblivious Medians Via Online Bidding
• On the computational power of demand queries
• Envy-Free Revenue Approximation for Asymmetric Buyers with Budgets
• On the efficiency of the proportional allocation mechanism for divisible resources
• Title not available (Why is that?)
• An Experimental Study of the Misdirection Algorithm for Combinatorial Auctions
• 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
• Worst-Case Mechanism Design via Bayesian Analysis
• An Efficient Winner Approximation for a Series of Combinatorial Auctions
• On bidding algorithms for a distributed combinatorial auction
• On the Efficiency of the Proportional Allocation Mechanism for Divisible Resources
• Approximating Nash social welfare under binary XOS and binary subadditive valuations
• Learning in auctions: regret is hard, envy is easy
• Approximation algorithms for a winner determination problem of single-item multi-unit auctions
• Fractionally Subadditive Maximization under an Incremental Knapsack Constraint with Applications to Incremental Flows
• Prophet secretary for combinatorial auctions and matroids
• Welfare maximization with friends-of-friends network externalities
• Combinatorial auctions with decreasing marginal utilities
• Approximating Nash social welfare by matching and local search
• Approximation algorithms for combinatorial auctions with complement-free bidders
• Approximation Algorithms for k-Duplicates Combinatorial Auctions with Subadditive Bidders
• Communication complexity of discrete fair division
• Bayesian optimal knapsack procurement
• Setting lower bounds on truthfulness
• Two-stage submodular maximization under knapsack and matroid constraints
• Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order
• Separating the Communication Complexity of Truthful and Nontruthful Algorithms for Combinatorial Auctions
• A Simple and Approximately Optimal Mechanism for a Buyer with Complements
• 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)