Inefficiencies on linking decisions
From MaRDI portal
Publication:2268896
DOI10.1007/S00355-009-0412-6zbMATH Open1201.91035OpenAlexW2133775554MaRDI QIDQ2268896FDOQ2268896
Authors: Rafael Hortala-Vallve 
Publication date: 15 March 2010
Published in: Social Choice and Welfare (Search for Journal in Brave)
Full work available at URL: https://ora.ox.ac.uk/objects/uuid:75c37d06-5407-4377-a558-3cdbaba19295
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
- Ironing, Sweeping, and Multidimensional Screening
- Group decision-making in the shadow of disagreement
- Strategy-proofness and Arrow's conditions: existence and correspondence theorems for voting procedures and social welfare functions
- Manipulation of Voting Schemes: A General Result
- Robust Mechanism Design
- Voting by Committees
- An Exploration in the Theory of Optimum Income Taxation
- Storable votes
- Overcoming Incentive Constraints by Linking Decisions
- Manipulation of Schemes that Mix Voting with Chance
- Strategy-proof cardinal decision schemes
- Separable Preferences, Strategyproofness, and Decomposability
- The taxation principle and multi-time Hamilton-Jacobi equations
- On a conjecture by Gale about one-sided matching problems
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)
