Pages that link to "Item:Q3169079"
From MaRDI portal
The following pages link to Approximation Algorithms for Combinatorial Auctions with Complement-Free Bidders (Q3169079):
Displaying 34 items.
- On the efficiency of the proportional allocation mechanism for divisible resources (Q506522) (← links)
- Inapproximability results for combinatorial auctions with submodular utility functions (Q943868) (← links)
- Setting lower bounds on truthfulness (Q1651232) (← links)
- Welfare maximization with friends-of-friends network externalities (Q1693985) (← links)
- On envy-free revenue approximation for combinatorial buyers with budgets (Q2032294) (← links)
- Approximating Nash social welfare under binary XOS and binary subadditive valuations (Q2152132) (← links)
- Learning in auctions: regret is hard, envy is easy (Q2155904) (← links)
- A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation (Q2436693) (← links)
- Combinatorial auctions with decreasing marginal utilities (Q2506310) (← links)
- Bayesian optimal knapsack procurement (Q2514780) (← links)
- Expected time complexity of the auction algorithm and the push relabel algorithm for maximum bipartite matching on random graphs (Q2795749) (← links)
- Envy-Free Revenue Approximation for Asymmetric Buyers with Budgets (Q2819463) (← 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)
- On the Efficiency of the Proportional Allocation Mechanism for Divisible Resources (Q3449590) (← links)
- Computing Stable Coalitions: Approximation Algorithms for Reward Sharing (Q3460775) (← links)
- Oblivious Medians Via Online Bidding (Q3525769) (← links)
- Approximation algorithms for combinatorial auctions with complement-free bidders (Q3581408) (← links)
- Approximation Algorithms for k-Duplicates Combinatorial Auctions with Subadditive Bidders (Q3611968) (← links)
- Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order (Q4571927) (← links)
- An Efficient Winner Approximation for a Series of Combinatorial Auctions (Q4932630) (← links)
- Worst-Case Mechanism Design via Bayesian Analysis (Q4978196) (← links)
- A Simple and Approximately Optimal Mechanism for a Buyer with Complements (Q4994150) (← links)
- When Are Welfare Guarantees Robust (Q5002625) (← links)
- (Q5002781) (← links)
- (Q5009503) (← links)
- Separating the Communication Complexity of Truthful and Nontruthful Algorithms for Combinatorial Auctions (Q5071085) (← links)
- (Q5743455) (← links)
- (Q5874477) (← links)
- Risk-free bidding in complement-free combinatorial auctions (Q5918704) (← links)
- Improved maximin guarantees for subadditive and fractionally subadditive fair allocation problem (Q6152666) (← links)
- Fractionally Subadditive Maximization under an Incremental Knapsack Constraint with Applications to Incremental Flows (Q6202753) (← links)
- Prophet secretary for combinatorial auctions and matroids (Q6640585) (← links)
- Communication complexity of discrete fair division (Q6663092) (← links)