Approximate Truthful Mechanism Design for Two-Dimensional Orthogonal Knapsack Problem (Q3196401): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q489133
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Guo-Chuan Zhang / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-319-21398-9_31 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2256064513 / rank
 
Normal rank
Property / cites work
 
Property / cites work: STACS 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: STACS 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computationally-feasible truthful auctions for convex bundles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Non-contiguous Multiple Organization Packing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Multiple Strip Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Techniques for Utilitarian Mechanism Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Multiple Subset Sum Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Truthful Mechanisms via Greedy Iterative Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252288 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417684 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Truthful Approximation Schemes for Single-Parameter Agents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Black-Box Randomized Reductions in Algorithmic Mechanism Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2867317 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417649 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Approximation Scheme for the Multiple Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing the total profit of rectangles packed into a rectangle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4941826 / rank
 
Normal rank
Property / cites work
 
Property / cites work: There is no EPTAS for two-dimensional knapsack / 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: Truth revelation in approximately efficient combinatorial auctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Truthful approximation mechanisms for restricted combinatorial auctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic mechanism design (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Strip-Packing Algorithm with Absolute Performance Bound 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online multiple-strip packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coordination Mechanisms for Selfish Parallel Jobs Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate algorithms to pack rectangles into several strips / rank
 
Normal rank

Latest revision as of 00:17, 11 July 2024

scientific article
Language Label Description Also known as
English
Approximate Truthful Mechanism Design for Two-Dimensional Orthogonal Knapsack Problem
scientific article

    Statements

    Approximate Truthful Mechanism Design for Two-Dimensional Orthogonal Knapsack Problem (English)
    0 references
    0 references
    0 references
    29 October 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    mechanism design
    0 references
    knapsack auction
    0 references
    approximation algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references