Truthful approximation mechanisms for restricted combinatorial auctions (Q2519488): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2041211404 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Approximate Truthful Mechanism for Combinatorial Auctions with Single Parameter Agents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-value combinatorial auctions and implementation in undominated strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Informational limitations of ascending combinatorial auctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation techniques for utilitarian mechanism design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for knapsack problems with cardinality constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Auctions: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mechanisms for Multi-Unit Auctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for combinatorial auctions with complement-free bidders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Truthful randomized mechanisms for combinatorial auctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incentives in Teams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximations of Weighted Independent Set and Hereditary Subset Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique is hard to approximate within \(n^{1-\epsilon}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bundling equilibrium in combinatorial auctions / 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: Heuristic algorithms for the multiple knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624066 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic mechanism design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Game Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The communication requirements of efficient allocations and supporting prices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3588651 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms, games, and the internet / rank
 
Normal rank
Property / cites work
 
Property / cites work: CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm for optimal winner determination in combinatorial auctions / rank
 
Normal rank

Latest revision as of 23:47, 28 June 2024

scientific article
Language Label Description Also known as
English
Truthful approximation mechanisms for restricted combinatorial auctions
scientific article

    Statements

    Truthful approximation mechanisms for restricted combinatorial auctions (English)
    0 references
    0 references
    0 references
    26 January 2009
    0 references
    mechanism design
    0 references
    combinatorial auctions
    0 references
    multi-unit auctions
    0 references
    multi-unit combinatorial auctions
    0 references
    approximation algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers