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.
- Sprache
-
Englisch
- Erschienen in
-
Series: Bonn Econ Discussion Papers ; No. 11/2001
- Klassifikation
-
Wirtschaft
Noncooperative Games
Bargaining Theory; Matching Theory
Asymmetric and Private Information; Mechanism Design
- Thema
-
Sequencing problems
Dominant strategy incentive compatibility
Efficiency
Budget balancedness
- Ereignis
-
Geistige Schöpfung
- (wer)
-
Mitra, Manipushpak
- Ereignis
-
Veröffentlichung
- (wer)
-
University of Bonn, Bonn Graduate School of Economics (BGSE)
- (wo)
-
Bonn
- (wann)
-
2000
- Handle
- Letzte Aktualisierung
-
10.03.2025, 11:42 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Objekttyp
- Arbeitspapier
Beteiligte
- Mitra, Manipushpak
- University of Bonn, Bonn Graduate School of Economics (BGSE)
Entstanden
- 2000
Ähnliche Objekte (12)
High Achieving First-Generation University Students
High Achieving First-Generation University Students
High Achieving First-Generation University Students
Best first surface realization
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
Simple Sequencing Problems with Interdependent Costs
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
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
Simple Sequencing Problems with Interdependent Costs
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
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
Simple Sequencing Problems with Interdependent Costs
The sequencing problem in sequential investigation processes
The Sequencing Problem in Sequential Investigation Processes
Lesbian Families : Achieving Mothermood
Achieving intelligence in mobility