Mechanisms for scheduling with single-bit private values (Q904689): Difference between revisions

From MaRDI portal
Added link to MaRDI 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00224-015-9625-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2015654884 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Lower Bounds for Anonymous Scheduling Mechanisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for scheduling mechanisms / 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: Q5417684 / 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: Truthful mechanism design for multidimensional scheduling via cycle monotonicity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Unified Approach to Truthful Scheduling on Related Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incentives in Teams / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lower Bound of 1 + φ for Truthful Scheduling Mechanisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4910748 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934709 / 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: A necessary and sufficient condition for rationalizability in a quasilinear context / rank
 
Normal rank

Revision as of 07:28, 11 July 2024

scientific article
Language Label Description Also known as
English
Mechanisms for scheduling with single-bit private values
scientific article

    Statements

    Identifiers