Inefficiencies on linking decisions
From MaRDI portal
Publication:2268896
Recommendations
- Overcoming Incentive Constraints by Linking Decisions
- Heuristic decision making in network linking
- Misallocation inefficiency in partially directed search
- Holdup, search, and inefficiency
- Locating inefficient links in a large-scale transportation network
- Decision making costs and problem solving performance
- Quantifying inefficiency in cost-sharing mechanisms
- scientific article; zbMATH DE number 4003237
- scientific article; zbMATH DE number 1583881
Cites work
- An Exploration in the Theory of Optimum Income Taxation
- Group decision-making in the shadow of disagreement
- Ironing, Sweeping, and Multidimensional Screening
- Manipulation of Schemes that Mix Voting with Chance
- Manipulation of Voting Schemes: A General Result
- On a conjecture by Gale about one-sided matching problems
- Overcoming Incentive Constraints by Linking Decisions
- Robust Mechanism Design
- Separable Preferences, Strategyproofness, and Decomposability
- Storable votes
- Strategy-proof cardinal decision schemes
- Strategy-proofness and Arrow's conditions: existence and correspondence theorems for voting procedures and social welfare functions
- The taxation principle and multi-time Hamilton-Jacobi equations
- Voting by Committees
Cited in
(5)
This page was built for publication: Inefficiencies on linking decisions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2268896)
