Balanced implementability of sequencing rules
From MaRDI portal
Publication:2278931
DOI10.1016/j.geb.2019.09.005zbMath1429.91152OpenAlexW2975153732WikidataQ127204999 ScholiaQ127204999MaRDI QIDQ2278931
Manipushpak Mitra, Parikshit De
Publication date: 12 December 2019
Published in: Games and Economic Behavior (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.geb.2019.09.005
sequencing rules\(i\)-CP sequencing rulesbalanced implementationGP-CM sequencing ruleslinear sequencing rules
Related Items
Cites Work
- Roberts' theorem with neutrality: a social welfare ordering approach
- Incentive compatible market design with applications
- Simple sequencing problems with interdependent costs
- Two simplified proofs for Roberts' theorem
- A necessary and sufficient condition for rationalizability in a quasilinear context
- Achieving the first best in sequencing problems.
- On optimal mechanism design for a sequencing problem
- Mechanism design with two alternatives in quasi-linear environments
- On the Generic Nonoptimality of Dominant-Strategy Allocation Mechanisms: A General Theorem That Includes Pure Exchange Economies
- Weak Monotonicity Characterizes Deterministic Dominant-Strategy Implementation
- A Modular Approach to Roberts’ Theorem
- On the Nonexistence of a Dominant Strategy Mechanism for Making Optimal Public Decisions
- Implementation in multidimensional dichotomous domains
- An Introduction to the Theory of Mechanism Design
- On Scheduling Fees to Prevent Merging, Splitting, and Transferring of Jobs
- Convex Analysis
- Unnamed Item
- Unnamed Item
