Bribeproof Mechanisms for Two-Values Domains (Q2819466): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Peter Widmayer / rank
Normal rank
 
Property / author
 
Property / author: Peter Widmayer / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2294314374 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1512.04277 / 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: Collusive dominant-strategy truthfulness / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Deterministic Truthful PTAS for Scheduling Related Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-unit auctions: beyond Roberts / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Performance of Deferred-Acceptance Auctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Lower Bounds for Non-utilitarian Truthfulness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921720 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Group strategyproof cost sharing: the role of indifferences / 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: Truthful mechanism design for multidimensional scheduling via cycle monotonicity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bribeproof Mechanisms for Two-Values Domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the constancy of bribe-proof solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental cost sharing: Characterization by coalition strategy-proofness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934709 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fair and group strategy-proof good allocation with money / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Auction Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic mechanism design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strategy-proof and efficient allocation of an indivisible good on finitely restricted preference domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal collusion-resistant mechanisms with verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complete characterization of group-strategyproof mechanisms of cost-sharing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3867502 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eliciting preferences to assign positions and compensation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Manipulation through bribes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pairwise strategy-proofness and self-enforcing manipulation / rank
 
Normal rank

Latest revision as of 14:51, 12 July 2024

scientific article
Language Label Description Also known as
English
Bribeproof Mechanisms for Two-Values Domains
scientific article

    Statements

    Bribeproof Mechanisms for Two-Values Domains (English)
    0 references
    0 references
    0 references
    0 references
    29 September 2016
    0 references
    bribeproof mechanism
    0 references
    monetary transfer
    0 references
    two-values domains
    0 references
    path auction
    0 references
    binary allocation
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers