A simple and fast algorithm for convex decomposition in relax-and-round mechanisms (Q1634087): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A new bidding framework for combinatorial e-auctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of Spectrum Auction Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feature Article—The Ellipsoid Method: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation techniques for utilitarian mechanism design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized metarounding (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving multiple scenarios in a combinatorial auction / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Programming Approximation of AC Power Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inapproximability of Truthful Mechanisms via Generalizations of the VC Dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Power of Randomization in Algorithmic Mechanism Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards more practical linear programming-based techniques for algorithmic mechanism design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bundling equilibrium in combinatorial auctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Convex Decomposition for Truthful Social Welfare Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Truthful and Near-Optimal Mechanism Design via Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of the Quadratic Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Game Theory / rank
 
Normal rank

Revision as of 16:19, 17 July 2024

scientific article
Language Label Description Also known as
English
A simple and fast algorithm for convex decomposition in relax-and-round mechanisms
scientific article

    Statements

    A simple and fast algorithm for convex decomposition in relax-and-round mechanisms (English)
    0 references
    0 references
    0 references
    0 references
    17 December 2018
    0 references
    algorithmic mechanism design
    0 references
    approximation algorithms
    0 references
    logistics
    0 references
    linear programming
    0 references

    Identifiers