Arbeitspapier
Achieving the First Best in Sequencing Problems
In a sequencing problem with linear time cost, Suijs (1996) proved that it is possible to achieve first best. By first best we mean that one can find mechanisms that satisfy efficiency of decision, dominant strategy incentive compatibility and budget balancedness. In this paper we show that among a more general and natural class of sequencing problems, sequencing problems with linear cost is the only class for which first best can be achieved.
- Language
-
Englisch
- Bibliographic citation
-
Series: Bonn Econ Discussion Papers ; No. 11/2001
- Classification
-
Wirtschaft
Noncooperative Games
Bargaining Theory; Matching Theory
Asymmetric and Private Information; Mechanism Design
- Subject
-
Sequencing problems
Dominant strategy incentive compatibility
Efficiency
Budget balancedness
- Event
-
Geistige Schöpfung
- (who)
-
Mitra, Manipushpak
- Event
-
Veröffentlichung
- (who)
-
University of Bonn, Bonn Graduate School of Economics (BGSE)
- (where)
-
Bonn
- (when)
-
2000
- Handle
- Last update
-
10.03.2025, 11:42 AM CET
Data provider
This object is provided by:
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. If you have any questions about the object, please contact the data provider.
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. If you have any questions about the object, please contact the data provider.
Object type
- Arbeitspapier
Associated
- Mitra, Manipushpak
- University of Bonn, Bonn Graduate School of Economics (BGSE)
Time of origin
- 2000
Other Objects (12)
High Achieving First-Generation University Students
High Achieving First-Generation University Students
High Achieving First-Generation University Students
Best first surface realization
Simple Sequencing Problems with Interdependent Costs
Prinzipal-Agent-Beziehung: First-best, second-best und third-best
Pricing, Capacity and Long-run Cost Functions for First-best and Second-best Network Problems
The Sequencing Problem in Sequential Investigation Processes
The sequencing problem in sequential investigation processes
Lesbian Families : Achieving Mothermood
Achieving intelligence in mobility
Constraint propagation algorithms for the car sequencing problem
High Achieving First-Generation University Students
High Achieving First-Generation University Students
High Achieving First-Generation University Students
Best first surface realization
Simple Sequencing Problems with Interdependent Costs
Prinzipal-Agent-Beziehung: First-best, second-best und third-best
Pricing, Capacity and Long-run Cost Functions for First-best and Second-best Network Problems
The Sequencing Problem in Sequential Investigation Processes
The sequencing problem in sequential investigation processes
Lesbian Families : Achieving Mothermood
Achieving intelligence in mobility
Constraint propagation algorithms for the car sequencing problem
High Achieving First-Generation University Students
High Achieving First-Generation University Students
High Achieving First-Generation University Students
Best first surface realization
Simple Sequencing Problems with Interdependent Costs
Prinzipal-Agent-Beziehung: First-best, second-best und third-best
Pricing, Capacity and Long-run Cost Functions for First-best and Second-best Network Problems
The Sequencing Problem in Sequential Investigation Processes
The sequencing problem in sequential investigation processes
Lesbian Families : Achieving Mothermood
Achieving intelligence in mobility