Truthful Generalized Assignments via Stable Matching (Q5244865): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1287/moor.2013.0625 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2143684800 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strategyproof Approximation of the Minimax on Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mix and match: a strategyproof mechanism for multi-hospital kidney exchange / rank
 
Normal rank
Property / cites work
 
Property / cites work: Erratum: The Stable Allocation (or Ordinal Transportation) Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Budget feasible mechanism design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balancing supply and demand under bilateral constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved 2-agent kidney exchange mechanism / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Approximability of Budgeted Allocations and Improved Lower Bounds for Submodular Welfare Maximization and GAP / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mechanism design with approximate valuations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Randomized Mechanisms for Combinatorial Auctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mechanism design with uncertain inputs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight approximation algorithms for maximum general assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: College Admissions and the Stability of Marriage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Manipulation of Voting Schemes: A General Result / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive auctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incentives in Teams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bayesian algorithmic mechanism design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549687 / 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: Q4273943 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strategy-proofness and Arrow's conditions: existence and correspondence theorems for voting procedures and social welfare functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for the generalized assignment problem / rank
 
Normal rank

Latest revision as of 21:47, 9 July 2024

scientific article; zbMATH DE number 6421303
Language Label Description Also known as
English
Truthful Generalized Assignments via Stable Matching
scientific article; zbMATH DE number 6421303

    Statements

    Truthful Generalized Assignments via Stable Matching (English)
    0 references
    0 references
    0 references
    0 references
    31 March 2015
    0 references
    generalized assignment
    0 references
    mechanism design
    0 references
    stable matching
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references