Computationally-feasible truthful auctions for convex bundles (Q932809): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Label placement by maximum independent set in rectangles / 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: Q4829039 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5715672 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time approximation schemes for packing and piercing fat objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3588651 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-Time Approximation Schemes for Geometric Intersection Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharing the cost of multicast transmissions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incentives in Teams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for covering and packing problems in image processing and VLSI / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250205 / 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: Algorithmic mechanism design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3867502 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computationally Manageable Combinational Auctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4953817 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear degree extractors and the inapproximability of max clique and chromatic number / rank
 
Normal rank

Revision as of 12:26, 28 June 2024

scientific article
Language Label Description Also known as
English
Computationally-feasible truthful auctions for convex bundles
scientific article

    Statements

    Computationally-feasible truthful auctions for convex bundles (English)
    0 references
    0 references
    0 references
    11 July 2008
    0 references
    mechanism design
    0 references
    auctions
    0 references
    approximation algorithms
    0 references

    Identifiers