Pages that link to "Item:Q5395669"
From MaRDI portal
The following pages link to Truthful and Near-Optimal Mechanism Design via Linear Programming (Q5395669):
Displaying 38 items.
- Approximate composable truthful mechanism design (Q344791) (← links)
- Towards more practical linear programming-based techniques for algorithmic mechanism design (Q506527) (← links)
- Truthful mechanism design via correlated tree rounding (Q526848) (← links)
- Truthful mechanism design for multidimensional scheduling via cycle monotonicity (Q834857) (← links)
- Dynamic mechanism design (Q1014626) (← links)
- A simple and fast algorithm for convex decomposition in relax-and-round mechanisms (Q1634087) (← links)
- Setting lower bounds on truthfulness (Q1651232) (← links)
- Truthfulness in advertising? Approximation mechanisms for knapsack bidders (Q1651735) (← links)
- A preference-based, multi-unit auction for pricing and capacity allocation (Q1652564) (← links)
- A universally-truthful approximation scheme for multi-unit auctions (Q1735729) (← links)
- Black-box reductions for cost-sharing mechanism design (Q1735730) (← links)
- Truthfulness with value-maximizing bidders: on the limits of approximation in combinatorial markets (Q1753496) (← links)
- Network pollution games (Q1755784) (← links)
- Strategyproof auction mechanisms for network procurement (Q2215560) (← links)
- Welfare maximization with production costs: a primal dual approach (Q2278952) (← links)
- New bounds for truthful scheduling on two unrelated selfish machines (Q2300622) (← links)
- On black-box transformations in downward-closed environments (Q2322707) (← links)
- Incentive compatible mulit-unit combinatorial auctions: a primal dual approach (Q2345944) (← links)
- Optimization with demand oracles (Q2414860) (← links)
- The anarchy of scheduling without money (Q2420568) (← links)
- Limitations of VCG-based mechanisms (Q2454572) (← links)
- Combinatorial auctions with verification are tractable (Q2512655) (← links)
- Bayesian incentive compatibility via matchings (Q2516250) (← links)
- Truthful approximation mechanisms for restricted combinatorial auctions (Q2519488) (← links)
- Cost sharing in two-sided markets (Q2670930) (← links)
- New Results for Network Pollution Games (Q2817847) (← links)
- Truthfulness and Approximation with Value-Maximizing Bidders (Q2819462) (← links)
- Black-Box Reductions in Mechanism Design (Q3088099) (← links)
- Single-Parameter Combinatorial Auctions with Partially Public Valuations (Q3162522) (← links)
- Approximate Truthful Mechanism Design for Two-Dimensional Orthogonal Knapsack Problem (Q3196401) (← links)
- Towards More Practical Linear Programming-Based Techniques for Algorithmic Mechanism Design (Q3449585) (← links)
- Primal Beats Dual on Online Packing LPs in the Random-Order Model (Q4554073) (← links)
- Algorithms as Mechanisms: The Price of Anarchy of Relax and Round (Q4991678) (← links)
- Separating the Communication Complexity of Truthful and Nontruthful Algorithms for Combinatorial Auctions (Q5071085) (← links)
- A $\frac{4}{3}$-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case (Q5096584) (← links)
- (Q5743441) (← links)
- (Q5743446) (← links)
- Truthful randomized mechanisms for combinatorial auctions (Q5891528) (← links)
