Truthful randomized mechanisms for combinatorial auctions (Q5891528): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.1016/j.jcss.2011.02.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1965161364 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic mechanism design (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4902563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3576736 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incentives in Teams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624066 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3588651 / 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: An improved approximation algorithm for combinatorial auctions with submodular bidders / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximizing welfare when utility functions are subadditive / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial auctions with decreasing marginal utilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549686 / 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: Competitive auctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Randomized Mechanisms for Combinatorial Auctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768374 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737215 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm for optimal winner determination in combinatorial auctions / 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: Q4471296 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bundling equilibrium in combinatorial auctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inapproximability results for combinatorial auctions with submodular utility functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The communication requirements of efficient allocations and supporting prices / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 05:15, 5 July 2024

scientific article; zbMATH DE number 6033478
Language Label Description Also known as
English
Truthful randomized mechanisms for combinatorial auctions
scientific article; zbMATH DE number 6033478

    Statements

    Truthful randomized mechanisms for combinatorial auctions (English)
    0 references
    0 references
    0 references
    0 references
    11 May 2012
    0 references
    combinatorial auctions
    0 references
    truthfulness
    0 references
    approximation algorithms
    0 references

    Identifiers