A lower bound for scheduling mechanisms (Q1031874): 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.1007/s00453-008-9165-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3136264843 / rank
 
Normal rank
Property / cites work
 
Property / cites work: STACS 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471296 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation techniques for utilitarian mechanism design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mechanism Design for Fractional Scheduling on Unrelated Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934711 / 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: Q3002852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3452917 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Truthful mechanism design for multidimensional scheduling via cycle monotonicity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for scheduling unrelated parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934709 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Auction Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic mechanism design (extended abstract) / 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:45, 2 July 2024

scientific article
Language Label Description Also known as
English
A lower bound for scheduling mechanisms
scientific article

    Statements

    A lower bound for scheduling mechanisms (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    23 October 2009
    0 references
    0 references
    algorithmic mechanism design
    0 references
    scheduling unrelated machines
    0 references
    lower bound
    0 references
    0 references