Spelling suggestions: "subject:"type dynamic"" "subject:"mype dynamic""
1 |
From commitment to non-commitment: allowing type dynamic in Laffont and Tirole's regulation modelAlves, Cassiano Breno Machado January 2013 (has links)
Submitted by Cassiano Breno Machado Alves (cbmachado@fgvmail.br) on 2013-03-25T17:36:15Z
No. of bitstreams: 1
Dissertação-CassianoAlves.pdf: 1625072 bytes, checksum: e0c471a98095069d8e0e991dcf7489cf (MD5) / Approved for entry into archive by Marcia Bacha (marcia.bacha@fgv.br) on 2013-04-03T18:51:06Z (GMT) No. of bitstreams: 1
Dissertação-CassianoAlves.pdf: 1625072 bytes, checksum: e0c471a98095069d8e0e991dcf7489cf (MD5) / Made available in DSpace on 2013-04-03T18:51:18Z (GMT). No. of bitstreams: 1
Dissertação-CassianoAlves.pdf: 1625072 bytes, checksum: e0c471a98095069d8e0e991dcf7489cf (MD5)
Previous issue date: 2012-05-03 / This paper investigates the introduction of type dynamic in the La ont and Tirole's regulation model. The regulator and the rm are engaged in a two period relationship governed by short-term contracts, where, the regulator observes cost but cannot distinguish how much of the cost is due to e ort on cost reduction or e ciency of rm's technology, named type. There is asymmetric information about the rm's type. Our model is developed in a framework in which the regulator learns with rm's choice in the rst period and uses that information to design the best second period incentive scheme. The regulator is aware of the possibility of changes in types and takes that into account. We show how type dynamic builds a bridge between com- mitment and non-commitment situations. In particular, the possibility of changing types mitigates the \ratchet e ect'. We show that for small degree of type dynamic the equilibrium shows separation and the welfare achived is close to his upper bound (given by the commitment allocation).
|
2 |
RSQL - a query language for dynamic data typesJäkel, Tobias, Kühn, Thomas, Voigt, Hannes, Lehner, Wolfgang 09 June 2021 (has links)
Database Management Systems (DBMS) are used by software applications, to store, manipulate, and retrieve large sets of data. However, the requirements of current software systems pose various challenges to established DBMS. First, most software systems organize their data by means of objects rather than relations leading to increased maintenance, redundancy, and transformation overhead when persisting objects to relational databases. Second, complex objects are separated into several objects resulting in Object Schizophrenia and hard to persist Distributed State. Last but not least, current software systems have to cope with increased complexity and changes. These challenges have lead to a general paradigm shift in the development of software systems. Unfortunately, classical DBMS will become intractable, if they are not adapted to the new requirements imposed by these software systems. As a result, we propose an extension of DBMS with roles to represent complex objects within a relational database and support the exibility required by current software systems. To achieve this goal, we introduces RSQL, an extension to SQL with the concept of objects playing roles when interacting with other objects. Additionally, we present a formal model for the logical representation of roles in the extended DBMS.
|
Page generated in 0.0551 seconds