The scholarship assignment problem
From MaRDI portal
Publication:700089
DOI10.1006/GAME.2001.0852zbMATH Open1023.91001OpenAlexW2146393798MaRDI QIDQ700089FDOQ700089
Pablo Amorรณs, Luis Corchรณn, Bernardo Moreno
Publication date: 30 September 2002
Published in: Games and Economic Behavior (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10016/3934
Cites Work
- Consistent Bayesian aggregation
- Strategy-proofness and Arrow's conditions: existence and correspondence theorems for voting procedures and social welfare functions
- A tale of two mechanisms: Student placement
- Manipulation of Voting Schemes: A General Result
- Implementation in Undominated Strategies: A Look at Bounded Mechanisms
- Strategy Space Reduction in Maskin's Theorem: Sufficient Conditions for Nash Implementation
- A simple proof of Maskin's theorem on Nash implementation
- A Bayesian model of voting in juries
- Game forms for Nash implementation of general social choice correspondences
Cited In (14)
- Implementing optimal scholarship assignments via backward induction
- Stable coalition governments: the case of three political parties
- An incentive dynamic programming method for the optimization of scholarship assignment
- Selecting winners with partially honest jurors
- Subgame perfect implementation of the deserving winner of a competition with natural mechanisms
- Picking the winners
- A natural mechanism for eliciting rankings when jurors have favorites
- A natural mechanism to choose the deserving winner when the jury is made up of all contestants
- Symmetry and impartial lotteries
- Eliciting socially optimal rankings from unfair jurors
- Eliciting the socially optimal allocation from responsible agents
- Evaluation and strategic manipulation
- Implementation Theory
- Choosing the winner of a competition using natural mechanisms: conditions based on the jury
Recommendations
- The assignment problem revisited ๐ ๐
- An assignment problem ๐ ๐
- An incentive dynamic programming method for the optimization of scholarship assignment ๐ ๐
- The dominance assignment problem ๐ ๐
- The assignment problem ๐ ๐
- A stochastic assignment problem ๐ ๐
- Algorithms and Computation ๐ ๐
- Implementing optimal scholarship assignments via backward induction ๐ ๐
- Title not available (Why is that?) ๐ ๐
- Title not available (Why is that?) ๐ ๐
This page was built for publication: The scholarship assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q700089)