To see the other types of publications on this topic, follow the link: Pareto.
Dissertations / Theses on the topic 'Pareto'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Pareto.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
Anabila, Moses A. "Skew Pareto distributions." abstract and full text PDF (free order & download UNR users only), 2008. http://0-gateway.proquest.com.innopac.library.unr.edu/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqdiss&rft_dat=xri:pqdiss:1453191.
Full text
2
Li, Cheuk Ming. "Pareto optimality and beyond." Thesis, McGill University, 1985. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=72066.
Full textAbstract:
The problem of social choice is the central theme of this study. Our main objective is to prove the existence of a social welfare function in order to put to rest the doctrine of 'natural liberty.' We reject most of the recently suggested solutions to the problem on the basis that they are either incomplete or inconsistent. Our proposed social welfare function is along the utilitarian line. Ratio-scale interpersonal comparisons of cardinal utilities are used to prove its existence. If we are allowed to define utilitarianism more broadly, then our social welfare function will also be unique. Finally, the study argues strongly for more positive action on the part of the government to rectify social injustice.
3
Oliveira, Rodolfo Lourenzutti Torres de. "Distribuição beta pareto truncada." Universidade Federal de Minas Gerais, 2012. http://hdl.handle.net/1843/BUOS-92FNQK.
Full textAbstract:
The Pareto distribution is widely used to modelling a diverse range of phenomena. Many transformations and generalization of the Pareto law distribution have been proposed in order to get more flexible models. In fact, these generalizations are very common in literature.Recently a new family of distribution, called Beta Generated distribution, was proposed. This family presents itself as a very flexible family, capable of modelling symmetric and skewed data. In this work we apply the beta transformation to the truncated Pareto distribution. We analyse some of its properties and apply it to real data. For estimation we the minimum
distance method. This new distribution, called Beta truncated Pareto, proved to be a very flexible.Depois de Vilfredo Pareto propor a distribuição Pareto (ver Arnold (1983)), em 1896, para modelar dados econômicos (salários e riquezas), foi descoberto que muitos dados nas mais diversas áreas podem ser modelados pela distribuição de Pareto. Existem aplicações da distribuição de Pareto em hidrologia (Malamud & Turcotte (2006)), geologia (Gutenberg & Richter (1944)), economia (Jayadev (2008)), física (Zaninneti & Ferraro (2008)), entre outras áreas. Além disso, diversas modificações para a distribuição de Pareto têm sido propostas. Destas, duas se destacaram, a distribuição Pareto truncada e a distribuição Pareto Generalizada. A primeira foi estudada por Aban, Meerschaert & Panorska (2006) e a segunda por Hosking & Wallis (1987).No decorrer do tempo foram propostas várias generalizações para as mais diversas distribuições de probabilidade. Atualmente uma nova família de distribuições generalizadas vem ganhando destaque. Eugene, Lee & Famoye (2002) propuseram uma generalização da distribuição Normal usando a função de distribuição acumulada da distribuição Beta. Mais tarde, Jones (2004) definiu a família de uma forma mais genérica e a chamou de família gerada da Beta. Akinsete, Famoye & Lee (2008) aplicaram essa transformação na distribuição Pareto obtendo a distribuição Beta Pareto.Zaninneti & Ferraro (2008) concluíram em seu trabalho que em muitos casos a distribuição Pareto truncada se ajusta melhor aos dados do que a distribuição Pareto. Dessa forma, considerando que a generalização Beta está em forte evidência atualmente, esse trabalho visa generalizar a família Pareto truncada usando a transformação beta, estudar a suas propriedades e compara-la com a Beta Pareto e com outras distribuições já propostas na literatura. Para lidar com o problema de estimação pontual foram utilizados dois métodos, o famoso método da máxima verossimilhança e o método da distância mínima (ver Wolfowitz (1953) e Pollard (1980)). Também é feita a aplicação da Beta Pareto Truncada a um conjunto de dados reais. Os detalhes são mostrados a seguir.
4
Bautista, Dianne Carrol Tan. "A Sequential Design for Approximating the Pareto Front using the Expected Pareto Improvement Function." The Ohio State University, 2009. http://rave.ohiolink.edu/etdc/view?acc_num=osu1237600537.
Full text
5
Lengvinaitė, Ieva. "Pareto atsitiktinių dydžių ekstremumų dydžiai." Master's thesis, Lithuanian Academic Libraries Network (LABT), 2006. http://vddb.library.lt/obj/LT-eLABa-0001:E.02~2006~D_20060530_112724-13091.
Full textAbstract:
Herein work is researching extremes asymptotic of Pareto random values. Here is analyzing geometrically maximum (minimum) stability tasks, also asymptotically tasks, when succession value is geometrical and geometrically stability of lower extremes. Aim of this work is to check if Pareto distribution values are stable maximum and minimum distributions and to continue researches in the area of lower extremes structures. It was proved that maximum (minimum) distribution (when ) is geometrically stable maximum (minimum) distribution, while others – asymptotically k-stable. When , maximum (minimum) distribution is asymptotically stable, only maximum distribution is also Pareto distribution, but with the displacement, while other - asymptotically k-stable.
6
Glaser, Eric L. "Pareto optimum improvement in Government contracting." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 1999. http://handle.dtic.mil/100.2/ADA374474.
Full textAbstract:
Thesis (M.S. in Management) Naval Postgraduate School, December 1999."December 1999". Thesis advisor(s): David R. Henderson, Jeffrey R. Cuskey. Includes bibliographical references (p. 131-134). Also available online.
7
Savulytė, Vaida. "Dvimačių Pareto dydžių maksimumų asimptotinė analizė." Master's thesis, Lithuanian Academic Libraries Network (LABT), 2007. http://vddb.library.lt/obj/LT-eLABa-0001:E.02~2007~D_20070816_142229-68037.
Full textAbstract:
Darbo tikslas – sukonstruoti dvimatį skirstinį, kai duoti vienmačiai (marginalieji) skirstiniai, atlikti maksimumų asimptotinę analizę ir ištirti konvergavimo greitį. Dvimatis skirstinys konstruojamas dviem atvejais: kai vektorių komponentės yra priklausomos ir nepriklausomos. Detalesnė konvergavimo greičio analizė atlikta, kai komponentės yra priklausomos. Tyrimui buvo pasirinktas Pareto skirstinys. Pirmoje tiriamosios dalies ir rezultatų dalyje yra konstruojamas dvimatis skirstinys, skaičiuojamos jo pagrindinės charakteristikos, tiriama, ar prie visų parametrų reikšmių jos egzistuoja. Taip pat generuojami atsitiktiniai dydžiai, kurių skirstiniai yra sukonstruotosios skirstinio funkcijos marginalieji skirstiniai, ir eksperimentiškai bandoma pagrįsti gautus rezultatus. Antroje dalyje atliekama asimptotinė analizė. Apibrėžiami dvimačiai maksimumai, ieškomas ribinis skirstinys. Juos suradus, apibrėžiamas apytikslis konvergavimo greičio įvertis, atliekama jo bei paklaidų kompiuterinė analizė, ieškoma, kokioms sąlygoms esant jie yra mažiausi. Sukonstruoto dvimačio skirstinio skaitinių charakteristikų tyrimas atliekama programiniu paketu MathCAD. Kompiuterinė konvergavimo greičio įverčių analizė atliekama programinio paketo Matlab pagalba. Jo aplinkoje buvo sukurta programa vartotojui, kuri nubraižo konvergavimo greičio įvertį bei paklaidas.The aim of this paper is to construct two-dimensional random variables, having one-dimensional ones, carry out the asymptotical analysis and study the speed of convergence. Two-dimensional distribution is constructed in two ways: when the components of random variables are independent and dependent. As in the last few years Pareto distribution is popular in financial models, it was chosen for the analyses. It was proved, that in both cases of independent and dependent components of the vector, the limit distribution is the same. This means that although the components of the vector are dependent, the maxima are asymptotically independent. Besides, the errors are smaller than the approximate estimate. Although, the approximate estimate in the case of independent components is smaller than in the case of dependent components, the errors are on the contrary: they are smaller when the components are dependent than when the components are independent.
8
Juozulynaitė, Gintarė. "Pareto atsitiktinių dydžių geometrinis maks stabilumas." Master's thesis, Lithuanian Academic Libraries Network (LABT), 2010. http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2010~D_20100830_094813-81556.
Full textAbstract:
Šiame darbe nagrinėjau vienmačių ir dvimačių Pareto atsitiktinių dydžių geometrinį maks stabilumą. Įrodžiau, kad vienmatis Pareto skirstinys yra geometriškai maks stabilus, kai alfa=1. Tačiau nėra geometriškai maks stabilus, kai alfa nelygu 1. Naudodamasi geometrinio maks stabilumo kriterijumi dvimačiams Pareto atsitiktiniams dydžiams, įrodžiau, kad dvimatė Pareto skirstinio funkcija nėra geometriškai maks stabili, kai vektoriaus komponentės nepriklausomos (kai alfa=1, beta=1 ir alfa nelygu 1, beta nelygu 1). Taip pat dvimatė Pareto skirstinio funkcija nėra geometriškai maks stabili, kai vektoriaus komponentės priklausomos (kai alfa=1, beta=1 ir alfa nelygu 1, beta nelygu 1). Dvimačių Pareto skirstinių tyrimas pateikė nelauktus rezultatus. Gauta, kad dvimatė Pareto skirstinio funkcija nėra geometriškai maks stabili, kai alfa=1, beta=1. Tačiau vienmatės marginaliosios Pareto skirstinio funkcijos yra geometriškai maks stabilios, kai alfa=1, beta=1.In this work I analyzed geometric max stability of univariate and bivariate Pareto random variables. I have proved, that univariate Pareto distribution is geometrically max stable when alpha=1. But it is not geometrically max stable when alpha unequal 1. Using the criterion of geometric max stability for bivariate Pareto random variables, I have proved, that bivariate Pareto distribution function is not geometrically max stable, when vectors’ components are independent (when alpha=1, beta=1 and alpha unequal 1, beta unequal 1). Also bivariate Pareto distribution function is not geometrically max stable, when vectors’ components are dependent (when alpha=1, beta=1 and alpha unequal 1, beta unequal 1). Research of bivariate Pareto distributions submitted unexpected results. Bivariate Pareto distribution function is not geometrically max stable, when alpha=1, beta=1. But marginal Pareto distribution functions are geometrically max stable, when alpha=1, beta=1.
9
Bhat, N. J. "Pareto optimal design of air bearings." Thesis, University of Huddersfield, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.430276.
Full text
10
Picot, Jérémy. "Variations autour du critère de Pareto." Caen, 2008. http://www.theses.fr/2008CAEN0654.
Full textAbstract:
Le critère de Pareto est sans aucun doute l'un des axiomes centraux de la théorie du choix social. Cette thèse se propose dans un premier temps de calculer la fréquence avec laquelle quatre fonctions de choix social ne respectent pas ce principe. Il s'agit de la procédure de vote par amendements, la procédure de vote par éliminations successives (qui sont deux règles de vote en usage dans les Parlements), le vote par élimination parallèle et la procédure par découpage. En d'autres termes, on détermine la probabilité avec laquelle une option va être choisie alors qu'il en existe une autre qui lui est unanimement préférée. Contrairement à ce qui est habituellement sous-entendu dans la littérature, la conclusion de cette étude ne remet pas en cause la légitimité de ces règles de vote. On s'intéresse ensuite à des fonctions qui ne mènent pas directement à un choix certain, mais indiquent pour chaque option (ou pour chaque ordre de préférence possible) la probabilité pour que celle-ci (ou celui-ci) devienne le choix de la société : les fonctions de choix social (ou de décision sociale) aléatoires. S'appuyant sur les travaux de Barberà et Sonnenschein (Journal of Economic Theory, 1978), et dans l'esprit de la contribution de Wilson (Journal of Economic Theory, 1972), on montre que dans ces modèles probabilistes, les fonctions insensibles à la manipulation stratégique individuelle (qui empêchent les individus de mentir sur leurs préférences dans le but d'améliorer leur position) sont associées à des fonctions soumises à un pouvoir coalitionnel qui se rapproche de la définition d'une dictature aléatoire
11
Ho, Ka Wing. "Multivariable controller design using pareto front." Master's thesis, University of Cape Town, 2011. http://hdl.handle.net/11427/11751.
Full textAbstract:
A multivariable thermal system with two inputs and two outputs is investigated. Its inputs are a pair of heaters controlled by a computer while its outputs are temperatures measured by two sensors. The system is fully interactive so two different controller structures can be used to ensure that the temperatures track their respective set-points. Both are multivariable controllers though one has a diagonal structure while the other has a triangular structure. Multi-objective optimization with a posteriori decision-making based on Pareto efficiency, level diagrams, hyper volumes and other performance indices is used to compare quantitatively the two controller structures when applied to a highly interactive multivariable system based on this plant.
12
Moore, David. "Optimal controller comparison using Pareto fronts." Master's thesis, University of Cape Town, 2010. http://hdl.handle.net/11427/11062.
Full textAbstract:
Includes abstract.Includes bibliographical references (leaves 131-133).
New design methods in Control Systems are regularly proposed. These new methods are typically compared to existing methods in a focused manner that highlights certain criteria, but may neglect other criteria. This thesis investigates the usefulness of Level Diagram visualisation and Performance Measures for Pareto fronts as tools for comparing modern control schemes in a more robust and objective manner.
13
Lin, Der-Chen. "Parameter Estimation for Generalized Pareto Distribution." DigitalCommons@USU, 1988. https://digitalcommons.usu.edu/etd/6974.
Full textAbstract:
The generalized Pareto distribution was introduced by Pickands (1975). Three methods of estimating the parameters of the generalized Pareto distribution were compared by Hosking and Wallis (1987) . The methods are maximum likelihood, method of moments and probability-weighted moments.
An alternate method of estimation for the generalized Pareto distribution, based on least square regression of expected order statistics (REOS), is developed and evaluated in this thesis . A Monte Carlo comparison is made between this method and the estimating methods considered by Hosking and Wallis (1987). This method is shown to be generally superior to the maximum likelihood, method of moments and probability-weighted moments
14
Liu, Yang. "Pareto-improving and revenue-neutral congestion pricing /." View abstract or full-text, 2007. http://library.ust.hk/cgi/db/thesis.pl?CIVL%202007%20LIU.
Full text
15
Janušauskas, Arūnas. "Gerber-Shiu baudos funkcijos skaičiavimas Pareto žaloms." Master's thesis, Lithuanian Academic Libraries Network (LABT), 2011. http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2010~D_20110709_152450-24338.
Full textAbstract:
Savo darbe mes nagrinėjame Gerber-Shiu baudos funkciją klasikiniame rizikos modelyje atveju, kai žalų dydžiai pasiskirstę pagal Pareto dėsnį. Pagrindinis uždavinys yra susikonstruoti algoritmą funkcijos reikšmių gavimui. Tiriamas Gerber-Shiu diskontuotos baudos funkcijos atvejis, kada vidinė baudos funkcija w tapačiai lygi vienetui. Dėl sudėtingos transformuoto Pareto skirstinio formos analitiškai paskaičiuoti sąsūkų nepavyko. Tam tikslui naudojamas interpoliavimas kubiniu splainu. N kartų kartodami sukonstruotą algoritmą gauname pirmąsias n sąsūkas laisvai pasirinktiems pradiniams parametrams: Pareto skirstinio laipsnio rodikliui α, pradiniam kapitalui u, santykinei draudimo priemokai θ, diskontavimo parametrui (palūkanų normai) δ ir Puasono proceso parametrui λ. Lentelių pagalba parodome funkcijos priklausomybę nuo skirtingų modeliuojančių parametrų reikšmių. Išvadose teigiame jog pasiūlytas metodas skaičiuoti Gerber-Shiu diskontuotos baudos funkciją nors ir išpildomas tačiau yra neefektyvus. Kai kuriais pradinių parametrų pasirinkimo atvejais susiduriama su tikslumo problema. Norint tiksliai paskaičiuoti funkcijos reikšmes reikia didesnių eilių transformuoto Pareto skirstinio sąsūkų, o tam reikalingi dideli resursai. Kita vertus, pradinio kapitalo u reikšmėms didėjant tikslumas didėja ženkliai.In this paper we consider Gerber-Shiu discounted penalty function in the classical risk model for Pareto claims. Our main goal is to construct an algorithm for obtaining values of the discounted penalty function (considering penalty function w=1). Due to the complicated form of the transformed Pareto distribution function we cannot obtain its convolutions analiticaly. We use numerical methods provided by Maple (cube spline) to find interpolating functions instead. Continuously applying recursive formulas we obtain first 5 interpolated convolutions. Then we calculate values of Gerber-Shiu discounted penalty function for certain arbitrary parameters: α – degree of Pareto distribution function, initial surplus u, security loading θ, discounting parameter δ and Poison process parameter λ. We present data tables and graphs of the discounted penalty function for some variations of parameters in later sections. Finally we state that the method that we use is quite complicated. For better accuracy of the discounted penalty function values one may require to get many convolutions of the transformed Pareto distribution function and that may require too great of the resources. However the quantity of the convolutions needed rapidly decreases for large values of the initial surplus u.
16
Vlassis, Nikolaos. "Aspects of Pareto improving environmental tax reforms." Thesis, University of Exeter, 2012. http://hdl.handle.net/10871/8561.
Full textAbstract:
'Climate change is the greatest and widest-ranging market failure ever seen' Stern (2006 p. xvii). This vigorous description highlights one of the most important and frustrating realizations of the last decades. The main reason of that market failure stems from the fact that climate change is a complex global externality. This makes the design of appropriate measures to mitigate the problem and the identification of their effects on economic activity of paramount importance. The transboundary nature of pollution combined with the skewed distribution of the origin and impact of emissions among countries reveals the need for international cooperation in the direction of multilateral agreements among countries. The characterization of Pareto-efficient environmental and trade policies has been a key issue (and continues to be) in the literature. Predominantly, however, the literature has focused on the role of taxes (trade and pollution) in achieving the first-best paying no attention to the role (if there is any) of non-tradeable goods. Chapter 4 deals with this issue. A key issue in mitigating climate change is with the appropriate extent of harmonization of environmental policies. This thesis (Chapters 2) addresses this within a general equilibrium model of international trade with endogenous pollution discharges, paying particular attention to the allocation of tax revenues. It argues that there indeed exist instances in which pollution tax harmonization (that moves the initial pollution taxes towards an appropriately weighted pollution tax vector) can deliver potential Pareto improvements. The difficulty with the achievement of global environmental agreements should not be, however, ignored. Chapter 3 deals with the possibility that governments may act unilaterally in order to mitigate the social cost of pollution. It shows that (under certain conditions) there exist unilateral Pareto improving trade policy reforms. Chapter 5 discusses the welfare implication of environmental policy reforms within a subset of countries. It shows that environmental policy coordination has opposing effect on the welfare of the coordinating and non-coordinating countries.
17
Oliveira, Luciana Aparecida Aliaga Azara de 1972. "Gramsci e Pareto : itinerários de ciência política." [s.n.], 2013. http://repositorio.unicamp.br/jspui/handle/REPOSIP/280143.
Full textAbstract:
Orientador: Alvaro Gabriel Bianchi MendezTese (doutorado) - Universidade Estadual de Campinas, Instituto de Filosofia e Ciências Humanas
Made available in DSpace on 2018-08-21T23:19:55Z (GMT). No. of bitstreams: 1 Oliveira_LucianaAparecidaAliagaAzarade_D.pdf: 1107081 bytes, checksum: 371676bfa0430d5014170c416983c83d (MD5) Previous issue date: 2013
Resumo: Embora o fenômeno das minorias dirigentes tenha sido tratado por diferentes autores, foi na Itália em finais do séc. XIX, por meio de Gaetano Mosca (1858-1941) e Vilfredo Pareto (1848-1923), que encontrou sistematização suficiente para alcançar status de teoria política. Antonio Gramsci (1891-1937), nos Quaderni del Carcere estabelece importante diálogo com a teoria das elites, externando confluências e distanciamentos. Em comum com os autores elitistas possui a tradição maquiaveliana dos estudos políticos, isto é, o realismo maquiaveliano, que é responsável por algumas extraordinárias continuidades temáticas e afinidades nas formulações gerais de conceitos políticos entre estes autores. Contudo, existe uma discussão subjacente à teoria das elites, que, apesar de ser menos aparente, nem por isso é menos importante - o debate acerca da possibilidade de formulação de uma ciência das realidades políticas. Por meio deste debate o realismo maquiaveliano adquire diferentes feições. Pareto reivindica uma ciência livre de ideais fictícios, calcada na observação empírica e histórica, o que o leva a compreender a divisão entre governantes e governados como uma realidade imutável, correspondente às divisões do gênero humano. Gramsci, por outro lado, propõe a formulação de uma ciência da política capaz de apreender as ocorrências históricas em sua complexidade compreendendo a "realidade" como fenômeno/aparência dos processos gerados no interior do movimento dialético entre estrutura e superestrutura. Isto o leva a entender o problema das elites por um viés histórico-político. Com isto, Gramsci contribui para um enriquecimento do realismo maquiaveliano. Desta discussão acerca da possibilidade e natureza da ciência política, importantes questões de ordem metodológica e política são trazidas a lume e são importantes, cremos, não apenas para os debates da ciência política da primeira metade do século XX, mas também suscitam problemas contemporâneos e embates no interior da ciência política que permanecem como questões fundamentais para o aperfeiçoamento dos instrumentos teórico-metodológicos da disciplina
Abstract: Although the phenomenon of minority officers has been treated by different authors, was in Italy at the end of the century. XIX, by Gaetano Mosca (1858-1941) and Vilfredo Pareto (1848-1923), who found systematic enough to achieve status of political theory. Antonio Gramsci (1891-1937), in Quaderni del Carcere establishes important dialogue with the theory of elites, expressing confluences and differences. In common with the authors has the elitist tradition of Machiavellian political studies, ie, the Machiavellian realism, which is responsible for some remarkable continuities and thematic affinities in the formulations of general political concepts between these authors. However, there is a discussion of the theory underlying the elites, who, though less apparent, so it is not less important - debate about the possibility of formulating a science of political realities. Through this debate Machiavellian realism acquires different features. Pareto claims science fictional ideals of freedom, based on empirical observation and history, which leads him to understand the division between rulers and ruled as an immutable reality, corresponding to the divisions of mankind. Gramsci, on the other hand, proposes the development of a science of politics can grasp the historical occurrences in their complexity comprising the "reality" as a phenomenon/appearance of the processes generated within the dialectical movement between structure and superstructure. This leads him to understand the problem of elites by a historical-political bias. With this, Gramsci contributes to an enrichment of Machiavellian realism. This discussion about the possibility and nature of political science, important methodological issues and policy are brought to light and are important, we believe, not only for discussions of political science in the first half of the twentieth century, but also raise contemporary issues and conflicts within science policy issues that remain fundamental to improving the theoretical and methodological tools of the discipline
Doutorado
Ciencia Politica
Doutora em Ciência Política
18
Hammache, Akli. "Estimation auto-adaptative de l'index de Pareto." Paris 6, 1992. http://www.theses.fr/1992PA066503.
Full textAbstract:
L'estimation de l'index d'une loi dont la queue est a variation reguliere a recu beaucoup d'attention ces dernieres annees. Dans notre travail, nous adaptons a ce probleme les techniques d'estimation ponctuelle d'une densite par la methode du noyau. Nous montrons d'une part que l'estimateur a noyau de l'index d'une loi de type pareto converge uniformement lorsque le parametre de lissage appartient a un intervalle de meme structure que celui de la fenetre de l'estimateur d'une densite. Les demonstrations sont basees sur des resultats des processus empiriques et des quantiles, des statistiques d'ordre ainsi que les proprietes des fonctions a variation reguliere a l'infini. D'autre part nous montrons que l'appartenance du parametre de lissage a l'intervalle precedent avec une probabilite qui tend vers un, entraine la convergence de l'estimateur. Ce qui permet l'utilisation de la procedure a deux etapes pour estimer l'index de pareto
19
OUAHRANI, ABDERRAHIM. "Estimation jointe dans la loi de pareto." Paris 6, 1998. http://www.theses.fr/1998PA066266.
Full textAbstract:
Le theme principal de cette these est l'estimation jointe des deux parametres d'une loi de pareto exacte, l'etude de leur consistance et leur normalite asymptotique. Dans cette optique, nous proposons un estimateur joint obtenu par une technique inspiree par le maximum de vraisemblance conditionnelle, et etudions sa convergence en probabilite. Nous proposons egalement un estimateur joint dans le cas du modele de hall (1982) et etudions sa convergence. Puis, nous utilisons une autre methode due a lloyd ((1952), (utilisee entre autres par sarhan (1954)) et permettant de construire un estimateur joint. Ensuite, nous etudions la convergence presque sure de cet estimateur ainsi obtenu et la vitesse de convergence correspondante. Pour conclure, nous donnons quelques resultats de simulations relativement a ces estimateurs.
20
Yearsley, Jonathan D. "Product family design using Smart Pareto filters /." Diss., CLICK HERE for online access, 2009. http://contentdm.lib.byu.edu/ETD/image/etd2687.pdf.
Full text
21
Yearsley, Jonathan D. "Product Family Design Using Smart Pareto Filters." BYU ScholarsArchive, 2008. https://scholarsarchive.byu.edu/etd/1664.
Full textAbstract:
Product families are frequently used to provide consumers with a variety of appealing products and to help maintain reasonably low production costs for manufacturers. Three common objectives in the design of product families are used to balance the interests of both consumers and manufacturers. These objectives are to maximize (i) product performance, (ii) product distinctiveness as perceived by the consumer, and (iii) product commonality as seen by the manufacturer. In this thesis, three methods are introduced that use multiobjective optimization and Smart Pareto filtering to satisfy the three objectives of product family design. The methods are progressive in nature and begin with the selection of product family members using Smart filtering and develop through the establishment of scale- based product platforms to the design of combined scale- based and module-based product platforms. Each of the methods is demonstrated using a well-know universal electric motor example problem. The results of each method are then compared to a benchmark electric motor product family that was previously defined in the literature. Additionally, a pressure vessel example problem is used to further demonstrate the first of the three methods.
22
Michel, René. "Simulation and estimation in multivariate generalized Pareto models." [S.l.] : [s.n.], 2006. http://deposit.ddb.de/cgi-bin/dokserv?idn=981745466.
Full text
23
Preisinger, Timotheus. "Graph-based algorithms for Pareto preference query evaluation." Norderstedt Books on Demand, 2009. http://d-nb.info/1000465993/34.
Full text
24
Teo, Jason T. W. Information Technology & Electrical Engineering Australian Defence Force Academy UNSW. "Pareto multi-objective evolution of legged embodied organisms." Awarded by:University of New South Wales - Australian Defence Force Academy. School of Information Technology and Electrical Engineering, 2003. http://handle.unsw.edu.au/1959.4/38682.
Full textAbstract:
The automatic synthesis of embodied creatures through artificial evolution has become a key area of research in robotics, artificial life and the cognitive sciences. However, the research has mainly focused on genetic encodings and fitness functions. Considerably less has been said about the role of controllers and how they affect the evolution of morphologies and behaviors in artificial creatures. Furthermore, the evolutionary algorithms used to evolve the controllers and morphologies are pre-dominantly based on a single objective or a weighted combination of multiple objectives, and a large majority of the behaviors evolved are for wheeled or abstract artifacts. In this thesis, we present a systematic study of evolving artificial neural network (ANN) controllers for the legged locomotion of embodied organisms. A virtual but physically accurate world is used to simulate the evolution of locomotion behavior in a quadruped creature. An algorithm using a self-adaptive Pareto multi-objective evolutionary optimization approach is developed. The experiments are designed to address five research aims investigating: (1) the search space characteristics associated with four classes of ANNs with different connectivity types, (2) the effect of selection pressure from a self-adaptive Pareto approach on the nature of the locomotion behavior and capacity (VC-dimension) of the ANN controller generated, (3) the effciency of the proposed approach against more conventional methods of evolutionary optimization in terms of computational cost and quality of solutions, (4) a multi-objective approach towards the comparison of evolved creature complexities, (5) the impact of relaxing certain morphological constraints on evolving locomotion controllers. The results showed that: (1) the search space is highly heterogeneous with both rugged and smooth landscape regions, (2) pure reactive controllers not requiring any hidden layer transformations were able to produce sufficiently good legged locomotion, (3) the proposed approach yielded competitive locomotion controllers while requiring significantly less computational cost, (4) multi-objectivity provided a practical and mathematically-founded methodology for comparing the complexities of evolved creatures, (5) co-evolution of morphology and mind produced significantly different creature designs that were able to generate similarly good locomotion behaviors. These findings attest that a Pareto multi-objective paradigm can spawn highly beneficial robotics and virtual reality applications.
25
Kuodis, Gediminas. "Kai kurios sudėtinio lognormaliojo – apibendrinto Pareto skirstinio savybės." Master's thesis, Lithuanian Academic Libraries Network (LABT), 2009. http://vddb.library.lt/obj/LT-eLABa-0001:E.02~2008~D_20090908_201800-26222.
Full textAbstract:
Šis darbas remiasi dviem straipsniais: Kahadawala Cooray, Malwane M. A. Amanda, „Modeling actuarial data with a composite lognormal – Pareto model“ (Scandinavian Actuarial Journal, 5, 321-334 psl.) ir McNeil Alexander J. „Estimating the tails of loss severity distributions using extreme value theory“ (ASTIN Bulletin, 27, 117-137 psl.). Pirmajame pristatomas sudėtinis lognormalusis – Pareto skirstinys. Antrajame nagrinėjamas apibendrintas Pareto skirstinys, tiriama, kaip jis aprašo dideles žalas. Šio magistro darbo tikslas yra sujungti lognormalųjį bei apibendrintą Pareto skirstinius. Pirmasis jų gerai aprašo mažas žalas su dideliais dažniais, antrasis – dideles, turinčias mažus dažnius. Darbe taip pat naudojamas kiek pakeistas Kahadawala Cooray ir Malwane M. A. Amanda straipsnyje pasiūlytas skirstinių sujungimo būdas. Šiame darbe ištirtos kai kurios sudėtinio lognormaliojo – apibendrinto Pareto skirstinio su keturiais laisvais parametrais savybės, pateiktas įverčių radimo metodas, bei, remiantis šiuo modeliu, išnagrinėtos trys duomenų imtys. Rezultatai rodo jog, dėl tam tikrų sujungimo savybių, modelis tinkamas aprašyti tiek didelėms, tiek mažoms žaloms, o, svarbiausia, mišrioms žaloms, tarp kurių pasitaiko tiek mažų, tiek labai didelių. Pastarojo tipo duomenys gana dažni draudimo praktikoje.This work is based on two articles: Kahadawala Cooray, Malwane M. A. Amanda, „Modeling actuarial data with a composite lognormal – Pareto model“ (Scandinavian Actuarial Journal, 5, pages 321-334) and McNeil Alexander J. „Estimating the tails of loss severity distributions using extreme value theory“ (ASTIN Bulletin, 27, pages 117-137). The first article presents a two - parameter smooth continuous composite lognormal - Pareto model. The second one analyses generalised Pareto distribution and how does this distribution cover large loses. The purpose of this writing is to mix lognormal and generalised Pareto distributions in to one four parameter smooth continuous distribution. The lognormal distribution is used to model small data with higher frequencies, and the generalised Pareto distribution is used to model large data with low frequencies. In this work we also try to use a modified way of mixing these two distributions than Kahadawala Cooray and Malwane M. A. Amanda used in their work. Writing also includes an analysis of some properties of this model, method of parameter estimation and three data sets analysis based on this distribution. The results show that because of some properties of mixing these two distributions, a composite model is suitable for covering small loses as well as it is suitable for covering large loses. But most important result is that the composite lognormal - generalised Pareto distribution is fit to cover data sets, which include small loses and... [to full text]
26
Baeshu, Abdurrazagh M. "Finite mixtures of generalized Pareto distributions with applications." Thesis, University of Salford, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.244856.
Full text
27
Kambourides, Miltos E. "Nonparametic-validated computer-simulation surrogates : a Pareto formuation." Thesis, Massachusetts Institute of Technology, 1997. http://hdl.handle.net/1721.1/43931.
Full text
28
LOPES, Luiz Gustavo Dias. "Fronteiras Equiespaçadas de Pareto para funções Objetivo Correlacionadas." reponame:Repositório Institucional da UNIFEI, 2015. http://repositorio.unifei.edu.br:8080/xmlui/handle/123456789/132.
Full textAbstract:
Submitted by repositorio repositorio (repositorio@unifei.edu.br) on 2015-10-14T14:42:40Z
No. of bitstreams: 1
tese_lopes_2015.pdf: 3489056 bytes, checksum: 30c301968a5bff8996d2321eec3093cd (MD5)Made available in DSpace on 2015-10-14T14:42:40Z (GMT). No. of bitstreams: 1 tese_lopes_2015.pdf: 3489056 bytes, checksum: 30c301968a5bff8996d2321eec3093cd (MD5) Previous issue date: 2015-05
O Método da Interseção Normal à Fronteira (NBI) é normalmente usado para gerar pontos equidistantes e uniformes na geração da fronteira de Pareto para problemas de otimização multiobjetivo não-lineares, oferecendo um conjunto de soluções ótimas. Estendendo-se a aplicação deste método ao Projeto de Parâmetro Robusto Multiobjetivo (MRPD) modelado por uma matriz combinada, o NBI pode ser muito útil para descobrir o melhor conjunto de variáveis controláveis capazes de minimizar o efeito das variáveis de ruído. No entanto, quando as diversas funções objetivo são correlacionadas o método NBI falha ao produzir resultados irreais e fronteiras não convexas que, influenciado pela atuação dos pesos, tenta separar as funções objetivo correlacionadas. Este inconveniente pode ser contornado se a Fronteira de Pareto for gerada a partir de funções não correlacionadas representadas pelos escores de componentes principais. Assim, acoplando o método NBI à Análise de Componentes Principais (PCA). Para os dados experimentais obtidos com matrizes combinadas, este trabalho apresenta uma abordagem capaz de tornar o processo menos sensível à variabilidade provocada por variáveis de ruído, enquanto identifica o conjunto de pontos ótimos numa fronteira de Pareto uniformemente distribuída. A aplicabilidade do método é ilustrada com a otimização de um processo de fresamento do aço AISI 1045. A confirmação da eficiência do método se dá após a fase de otimização, no qual três pontos da fronteira foram escolhidos para execução dos experimentos de confirmação. O planejamento, por meio de um Taguchi L9, indicou a necessidade de 27 experimentos para testar uma diferença de magnitude de 0,2 mm para Ra e 1,8 mm para Rt com um poder (1-β) de 82%, considerando-se, para cada resposta, nove condições de ruído. Os resultados dos experimentos de confirmação se localizaram dentro dos intervalos de confiança estabelecidos para médias e variâncias, respectivamente, o que demonstra a capacidade do método NBI-PCA de mitigar a influência das variáveis de ruído em processos de respostas múltiplas para qualquer peso desejado.
29
Makatura, Liane. "Pareto Gamuts : exploring optimal designs across varying contexts." Thesis, Massachusetts Institute of Technology, 2020. https://hdl.handle.net/1721.1/129366.
Full textAbstract:
Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, September, 2020Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 69-73).
Manufactured parts are meticulously engineered to perform well with respect to several conflicting metrics, like weight, stress, and cost. The best achievable trade-offs reside on the Pareto front, which can be discovered via performance-driven optimization. Objective functions used to define the Pareto front often incorporate assumptions about the context in which a part will be used, including loading conditions, environmental influences, material properties, or regions that must be preserved to interface with a surrounding assembly. Existing multi-objective optimization tools are only equipped to study one context at a time, so engineers must run independent optimizations for each context of interest. However, engineered parts frequently appear in many contexts: wind turbines must perform well in many wind speeds, and a bracket might be optimized several times with its bolt-holes fixed in different locations on each run. In this paper, we formulate a framework for variable-context multi-objective optimization. We introduce the Pareto gamut, which captures Pareto fronts over a range of contexts. We develop a global-local optimization algorithm to discover the Pareto gamut directly, rather than discovering a single fixed-context "slice" at a time. To validate our method, we adapt existing multi-objective optimization benchmarks to contextual scenarios. We also demonstrate the practical utility of Pareto gamut exploration for several engineering design problems.
by Liane Makatura.
S.M.
S.M. Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science
30
Benkirane, Mohamed. "Condition suffisante pour un optimum de pareto local." Grenoble 2 : ANRT, 1986. http://catalogue.bnf.fr/ark:/12148/cb37595920c.
Full text
31
Ribeiro, Marco Tulio Correia. "Multi-objective pareto-efficient algorithms for recommender systems." Universidade Federal de Minas Gerais, 2013. http://hdl.handle.net/1843/ESSA-9CHG5H.
Full textAbstract:
Recommender systems are quickly becoming ubiquitous in applications such as ecommerce, social media channels and content providers, acting as enabling mechanisms designed to overcome the information overload problem by improving browsing and consumption experience. A typical task in recommender systems is to output a ranked list of items, so that items placed higher in the rank are more likely to be interesting to the users. Interestingness measures include how accurate, novel and diverse the suggested items are, and the objective is usually to produce ranked lists optimizing one of these measures. Suggesting items that are simultaneously accurate, novel and diverse is much more challenging, since this may lead to a conflicting-objective problem, in which the attempt to improve a measure further may result in worsening other measures. In this thesis we propose new approaches for multi-objective recommender systems based on the concept of Pareto-efficiency -- a state achieved when the system is devised in the most efficient manner in the sense that there is no way to improve one of the objectives without making any other objective worse off. Given that existing recommendation algorithms differ in their level of accuracy, diversity and novelty, we exploit the Pareto-efficiency concept in two distinct manners: (i) the aggregation of ranked lists produced by existing algorithms into a single one, which we call Paretoefficient ranking, and (ii) the weighted combination of existing algorithms resulting in a hybrid one, which we call Pareto-efficient hybridization. Our evaluation involves two real application scenarios: music recommendation with implicit feedback (i.e., Last.fm) and movie recommendation with explicit feedback (i.e., MovieLens). We show that the proposed approaches are effective in optimizing each of the metrics without hurting the others, or optimizing all three simultaneously. Further, for the Pareto-efficient hybridization, we allow for adjusting the compromise between the metrics, so that the recommendation emphasis can be set dinamically according to the needs of different users.Sistemas de recomendação tem se tornado cada vez mais populares em aplicações como e-commerce, mídias sociais e provedores de conteúdo. Esses sistemas agem como mecanismos para lidar com o problema da sobrecarga de informação. Uma tarefa comum em sistemas de recomendação é a de ordenar um conjunto de itens, de forma que os itens no topo da lista sejam de interesse para os usuários. O conceito de interesse pode ser medido observando a acurácia, novidade e diversidade dos itens sugeridos. Geralmente, o objetivo de um sistema de recomendação é gerar listas ordenadas de forma a otimizar uma dessas métricas. Um problema mais difícil é tentar otimizar as três métricas (ou objetivos) simultaneamente, o que pode levar ao caso onde a tentativa de melhorar em uma das métricas pode piorar o resultado nas outras métricas. Neste trabalho, propomos novas abordagens para sistemas de recomendaççao multi-objetivo, baseadas no conceito de Eficiência de Pareto -- um estado obtido quando o sistema é de tal forma que não há como melhorar em algum objetivo sem piorar em outro objetivo. Dado que os algoritmos de recomendação existentes diferem em termos de acurácia, diversidade e novidade, exploramos o conceito de Eficiência de Pareto de duas formas distintas: (i) agregando listas ordenadas produzidas por algoritmos existentes de forma a obter uma lista única - abordagem que chamamos de ranking Pareto-eficiente, e (ii), a combinação linear ponderada de algoritmos existentes, resultado em um híbrido, abordagem que chamamos de hibridização Pareto-eficiente. Nossa avaliação envolve duas aplicações reais: recomendação de música com feedback implícito (i.e., Last.fm) e recomendação de filmes com feedback explícito (i.e., Movielens). Nós mostramos que as abordagens Pareto-eficientes são efetivas em recomendar items com bons niveis de acurácia, novidade e diversidade (simultaneamente), ou uma das métricas sem piorar as outras. Além disso, para a hibridização Pareto-eficiente, provemos uma forma de ajustar o compromisso entre acurácia, novidade e diversidade, de forma que a ênfase da recomendação possa ser ajustada dinamicamente para usuários diferentes.
32
Nordström, Peter. "Multi-objective optimization and Pareto navigation for voyage planning." Thesis, Uppsala universitet, Avdelningen för systemteknik, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-220338.
Full textAbstract:
The shipping industry is very large and ships require a substantial amount of fuel. However, fuel consumption is not the only concern. Time of arrival, safety concerns, distance travelled etc. are also of importance and these objectives might be inherently conflicting. This thesis aims to demonstrate multi-objective optimization and Pareto navigation for application in voyage planning. In order to perform this optimization, models of weather, ocean conditions, ship dynamics and propulsion system are needed. Statistical methods for estimation of resistance experienced in calm and rough sea are used. An earlier developed framework is adopted to perform the optimization and Pareto navigation. The results show that it is a suitable approach in voyage planning. A strength of the interactive Pareto navigation is the overview of the solution space presented to the decision maker and the control of the spread of the objective space. Another benefit is the possibilities of assigning specific values on objectives and setting thresholds in order to narrow down the solution space. The numerical results reinforces the trend of slow steaming to decrease fuel consumption.
33
Žuklijaitė, Viktorija. "Nupjauto lognormaliojo ir Pareto skirstinių mišinio kai kurios savybės." Master's thesis, Lithuanian Academic Libraries Network (LABT), 2009. http://vddb.library.lt/obj/LT-eLABa-0001:E.02~2008~D_20090908_201754-58937.
Full textAbstract:
Draudimo matematikoje modeliuojant žalas dažnai naudojami dviejų parametrų lognormalusis ir Pareto skirstiniai. Lognormalusis skirstinys taikomas mažoms žaloms su dideliu dažniu aprašyti, o Pareto – didelėms su mažu. Siekiant, kad skirstinys vienodai gerai aprašytu visų tipų žalas, sudaromas nupjauto lognormaliojo ir Pareto skirstinių mišinys su trimis laisvais parametrais. Šis darbas parašytas remiantis Kahadawala Cooray ir Malwane M. A. Ananda straipsniu "Modeling actuarial data with a composite lognormal – Pareto model" ("Scandinavian Actuarial Journal", 2005, 5, 321 - 334 psl.), kuriame nagrinėjamas sudėtinis lognormalusis – Pareto skirstinys. Darbe nagrinėjami lognormalusis ir Pareto skirstiniai, aptariama, kodėl jie turėtų būti naudojami kartu kaip mišinys, pateikiamas nupjauto lognormaliojo ir Pareto skirstinių mišinio tankio funkcijos išvedimas, grafiškai iliustruojamas jos kitimas, priklausomai nuo parametrų parinkimo. Praktinėje dalyje nagrinėjamos trys imtys: sudėtiniu lognormaliuoju – Pareto skirstiniu modeliuoti duomenys, vienos Lietuvos draudimo bendrovės draudimo nuo nelaimingų atsitikimų žalos ir Danijos gaisrų draudimo žalos. Didžiausio tikėtinumo metodu skaitiškai įvertinami mišinio parametrai kiekvienai imčiai, gauti rezultatai lyginami su sudėtinio lognormaliojo – Pareto, lognormaliojo, Pareto, Gama, Weibull skirstinių didžiausio tikėtinumo įverčiais. Palyginimui naudojami Kolmogorovo – Smirnovo, Andersono – Darlingo kriterijai ir chi kvadrato suderinamumo... [toliau žr. visą tekstą]In insurance mathematics are often used the lognormal ant the Pareto distributions with two parameters to model loss data. The lognormal distribution is used to model small data with higher frequencies, while the Pareto distribution is used to model large data with low frequencies. In order to achieve both of these losses in one model, the truncated lognormal and the Pareto distributions mixture with three parameter is presented. This work is written with reference to Kahadawala Cooray ir Malwane M. A. Ananda article "Modeling actuarial data with a composite lognormal – Pareto model" ("Scandinavian Actuarial Journal", 2005, 5, 321 - 334 pages), where composite lognormal – Pareto model is researched. In this work the necessity of the lognormal and the Pareto distributions mixture is discussed, the derivation of the truncated lognormal and the Pareto distributions mixture model are presented and behaviour of density function in dependent of parameter variation is discussed by illustrating. For practical application three data sets are chosen: simulated from the composite lognormal – Pareto distribution, personal accident insurance loss of one Lithuania insurance company, Danish fire loss data. For the each of data sets the parameters are estimated using maximum likelihood function, resulted estimators are compared with maximum likelihood estimators of composite lognormal – Pareto, lognormal, Pareto, Gamma and Weibull distributions. In order to compare the models the following... [to full text]
34
Knowles, Joshua D. "Local-search and hybrid evolutionary algorithms for Pareto optimization." Thesis, University of Reading, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.394429.
Full text
35
Ziebach, Thorsten. "Die Modellierung der personellen Einkommensverteilung mit verallgemeinerten Pareto-Kurven /." Lohmar : Eul, 2000. http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&doc_number=009053914&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA.
Full text
36
Ismaïli, Anisse. "Algorithms for Nash-equilibria in Agent Networks and for Pareto-efficiency in State Space Search : Generalizations to Pareto-Nash in Multiple Objective Games." Thesis, Paris 6, 2016. http://www.theses.fr/2016PA066148.
Full textAbstract:
Un agent est un élément qui décide une action. Par ce formalisme très général on peut aussi bien désigner deux enfants jouant à pierre-papier-ciseaux, des êtres humains choisissant des produits sur un marché, un logiciel de routage calculant un plus court chemin sur Internet pour transporter des informations sur des routes numériques encombrées, qu’une enchère combinatoire automatique pour vendre des liens commerciaux et rapportant des milliards à google. Les chercheurs en théorie de la décision algorithmique et en théorie des jeux algorithmique – des mathématiciens et informaticiens – aiment à penser que ces exemples concrets peuvent être modélisés au moyen de systèmes décisionnels rationnels, aussi complexe la réalité soit-elle. Les systèmes décisionnels modernes trouvent leur complexité dans plusieurs dimensions. D’une part, les préférences d’un agent peuvent être complexes à représenter avec de simples nombres réels, alors que de multiples objectifs conflictuels interviennent dans chaque décision. D’une autre part, les interactions entre agents font que les récompenses de chacun dépendent des actions de tous, rendant difficile la prédiction des actions individualistes résultantes. L’objet de cette thèse en théorie algorithmique des systèmes décisionnels interactifs (jeux) est de poursuivre des efforts de recherche menés sur ces deux sources de complexité, et in fine, de considérer les deux complexités dans un même modèleAn agent is an entity that decides an action. By using this abstraction, it is possible to model two children playing rock-paper-scissors, a software computing a shortest path on the internet for packet-routing on congest numerical networks, as well as an automatic combinatorial auction that sells commercial links in order to make google earn billions. The researchers in algorithmic decision theory and algorithmic game theory (mathematicians and computer scientists) like to think that these real-life examples can be modelled by mean of agents in an interaction decision system, no matter how complex is reality. The modern interactive decision systems find their complexity in multiple aspects. Firstly, the preferences of an agent can be complex to model with real numbers when there are multiple conflicting objectives resulting from every decision. Secondly, the interactions between agents are such that the payoff of every individual depends of the actions of all, making difficult the prediction of the resulting action-profile. This thesis aims at pursuing research efforts lead on these two sources of complexity, in order to consider ultimately both aspects in the same model
37
Ismaïli, Anisse. "Algorithms for Nash-equilibria in Agent Networks and for Pareto-efficiency in State Space Search : Generalizations to Pareto-Nash in Multiple Objective Games." Electronic Thesis or Diss., Paris 6, 2016. http://www.theses.fr/2016PA066148.
Full textAbstract:
Un agent est un élément qui décide une action. Par ce formalisme très général on peut aussi bien désigner deux enfants jouant à pierre-papier-ciseaux, des êtres humains choisissant des produits sur un marché, un logiciel de routage calculant un plus court chemin sur Internet pour transporter des informations sur des routes numériques encombrées, qu’une enchère combinatoire automatique pour vendre des liens commerciaux et rapportant des milliards à google. Les chercheurs en théorie de la décision algorithmique et en théorie des jeux algorithmique – des mathématiciens et informaticiens – aiment à penser que ces exemples concrets peuvent être modélisés au moyen de systèmes décisionnels rationnels, aussi complexe la réalité soit-elle. Les systèmes décisionnels modernes trouvent leur complexité dans plusieurs dimensions. D’une part, les préférences d’un agent peuvent être complexes à représenter avec de simples nombres réels, alors que de multiples objectifs conflictuels interviennent dans chaque décision. D’une autre part, les interactions entre agents font que les récompenses de chacun dépendent des actions de tous, rendant difficile la prédiction des actions individualistes résultantes. L’objet de cette thèse en théorie algorithmique des systèmes décisionnels interactifs (jeux) est de poursuivre des efforts de recherche menés sur ces deux sources de complexité, et in fine, de considérer les deux complexités dans un même modèleAn agent is an entity that decides an action. By using this abstraction, it is possible to model two children playing rock-paper-scissors, a software computing a shortest path on the internet for packet-routing on congest numerical networks, as well as an automatic combinatorial auction that sells commercial links in order to make google earn billions. The researchers in algorithmic decision theory and algorithmic game theory (mathematicians and computer scientists) like to think that these real-life examples can be modelled by mean of agents in an interaction decision system, no matter how complex is reality. The modern interactive decision systems find their complexity in multiple aspects. Firstly, the preferences of an agent can be complex to model with real numbers when there are multiple conflicting objectives resulting from every decision. Secondly, the interactions between agents are such that the payoff of every individual depends of the actions of all, making difficult the prediction of the resulting action-profile. This thesis aims at pursuing research efforts lead on these two sources of complexity, in order to consider ultimately both aspects in the same model
38
Daskilewicz, Matthew John. "Methods for parameterizing and exploring Pareto frontiers using barycentric coordinates." Diss., Georgia Institute of Technology, 2013. http://hdl.handle.net/1853/47658.
Full textAbstract:
The research objective of this dissertation is to create and demonstrate methods for parameterizing the Pareto frontiers of continuous multi-attribute design problems using barycentric coordinates, and in doing so, to enable intuitive exploration of optimal trade spaces. This work is enabled by two observations about Pareto frontiers that have not been previously addressed in the engineering design literature. First, the observation that the mapping between non-dominated designs and Pareto efficient response vectors is a bijection almost everywhere suggests that points on the Pareto frontier can be inverted to find their corresponding design variable vectors. Second, the observation that certain common classes of Pareto frontiers are topologically equivalent to simplices suggests that a barycentric coordinate system will be more useful for parameterizing the frontier than the Cartesian coordinate systems typically used to parameterize the design and objective spaces.
By defining such a coordinate system, the design problem may be reformulated from y = f(x) to (y,x) = g(p) where x is a vector of design variables, y is a vector of attributes and p is a vector of barycentric coordinates. Exploration of the design problem using p as the independent variables has the following desirable properties: 1) Every vector p corresponds to a particular Pareto efficient design, and every Pareto efficient design corresponds to a particular vector p. 2) The number of p-coordinates is equal to the number of attributes regardless of the number of design variables. 3) Each attribute y_i has a corresponding coordinate p_i such that increasing the value of p_i corresponds to a motion along the Pareto frontier that improves y_i monotonically.
The primary contribution of this work is the development of three methods for forming a barycentric coordinate system on the Pareto frontier, two of which are entirely original. The first method, named "non-domination level coordinates," constructs a coordinate system based on the (k-1)-attribute non-domination levels of a discretely sampled Pareto frontier. The second method is based on a modification to an existing "normal boundary intersection" multi-objective optimizer that adaptively redistributes its search basepoints in order to sample from the entire frontier uniformly. The weights associated with each basepoint can then serve as a coordinate system on the frontier. The third method, named "Pareto simplex self-organizing maps" uses a modified a self-organizing map training algorithm with a barycentric-grid node topology to iteratively conform a coordinate grid to the sampled Pareto frontier.
39
Asanavičiūtė, Rasa. "Gerber-Shiu diskontuota baudos funkcija žaloms pasiskirčiusioms pagal Pareto dėsnį." Master's thesis, Lithuanian Academic Libraries Network (LABT), 2014. http://vddb.library.lt/obj/LT-eLABa-0001:E.02~2006~D_20140702_192937-54640.
Full textAbstract:
Darbe gauta Gerber-Shiu diskontuotos baudos funkcijos asimptotika, kai žalos pasiskirsčiusios pagal Pareto dėsnį ir pradinis kapitalas x artėja į begalybę. Pagrindinė išraiška Gerber-Shiu diskontuotos baudos funkcijos išskaidyta į du atvejus, kai palūkanų norma nelygi ir lygi nuliui. Darbe pateikti grafikai rodo diskontuotos baudos funkcijos priklausomybę nuo įvairių Puasono modelio parametrų.The asymptotic of the Gerber-Shiu discounted penalty function in Poisson model with Pareto distributed claims is obtained. The asymptotic is obtained as initial surplus x tends to infinity. The main term of discounted penalty function has different expression in case when interest rate equal zero and when doesn't equal zero. The graphs of the Gerber-Shiu discounted penalty function in the case of Pareto claims are examined for various parameter choices.
40
Thomas, Mark W. "A Pareto frontier for full stern submarines via genetic algorithm." Thesis, Monterey, California. Naval Postgraduate School, 1998. http://hdl.handle.net/10945/8803.
Full text
41
Thomas, Mark W. (Mark Wayne). "A Pareto frontier for full stern submarines via genetic algorithm." Thesis, Massachusetts Institute of Technology, 1998. http://hdl.handle.net/1721.1/9998.
Full text
42
Preisinger, Timotheus [Verfasser]. "Graph-based algorithms for Pareto preference query evaluation / Timotheus Preisinger." Norderstedt : Books on Demand, 2009. http://d-nb.info/1000465993/34.
Full text
43
Calabresi, Guido. "El sin sentido de Pareto: llevando a Coase más lejos." IUS ET VERITAS, 2016. http://repositorio.pucp.edu.pe/index/handle/123456789/123444.
Full text
44
Aqueci, Francesco. "Die Kritik des juristischen und moralischen Diskurses bei Vilfredo Pareto." Universität Leipzig, 2000. https://ul.qucosa.de/id/qucosa%3A33382.
Full text
45
Nouioua, Karim. "Enveloppes de Pareto et Réseaux de Manhattan : caractérisations et algorithmes." Aix-Marseille 2, 2005. http://theses.univ-amu.fr.lama.univ-amu.fr/2005AIX22062.pdf.
Full text
46
Erfani, Tohid. "An efficient analysis of pareto optimal solutions in multidisciplinary design." Thesis, University of Manchester, 2011. https://www.research.manchester.ac.uk/portal/en/theses/an-efficient-analysis-of-pareto-optimal-solutions-in-multidisciplinary-design(9bcf3c8f-4922-48a7-a829-1efce3d804ab).html.
Full textAbstract:
Optimisation is one of the most important and challenging part of any engineering design. In real world design problems one faces multiobjective optimisation under constraints. The optimal solution in these cases is not unique because the objectives can contradict each other. In such cases, a set of optimal solutions which forms a Pareto frontier in the objective space is considered. There are many algorithms to generate the Pareto frontier. However, only a few of them are potentially capable of providing an evenly distributed set of the solutions. Such a property is especially important in real-life design because a decision maker is usually able to analyse only a very limited quantity of solutions. This thesis consists of two main parts. At first, it develops and gives the detailed description of two different algorithms that are able to generate an evenly distributed Pareto set in a general formulation. One is a classical approach and called Directed Search Domain (DSD) and the other, the cylindrical constraint evolutionary algorithm (CCEA), is a hybrid population based method. The efficiency of the algorithms are demonstrated by a number of challenging test cases and the comparisons with the results of the other existing methods. It is shown that the proposed methods are successful in generating the Pareto solutions even when some existing methods fail. In real world design problems, deterministic approaches cannot provide a reliable solution as in the event of uncertainty, deterministic optimal solution would be infeasible in many instances. Therefore a solution less sensitive to problem perturbation is desirable. This leads to the robust solution which is the focus of the second part of the thesis. In the literature, there are some techniques tailored for robust optimisation. However, most of them are either computationally expensive or do not systematically articulate the designer preferences into a robust solution. In this thesis, by introducing a measure for robustness in multiobjective context, a tunable robust function (TRF) is presented. Including the TRF in the problem formulation, it is demonstrated that the desirable robust solution based on designer preferences can be obtained. This not only provides the robust solution but also gives a control over the robustness level. The method is efficient as it only increases the dimension of the problem by one irrespective of the dimension of the original problem.
47
Reynolds, Joel Howard. "Multi-criteria assessment of ecological process models using pareto optimization /." Thesis, Connect to this title online; UW restricted, 1997. http://hdl.handle.net/1773/6377.
Full text
48
Arendt, Christopher D. "Adaptive Pareto Set Estimation for Stochastic Mixed Variable Design Problems." Ft. Belvoir : Defense Technical Information Center, 2009. http://handle.dtic.mil/100.2/ADA499860.
Full text
49
Lewis, Patrick K. "An Optimization-Based Method of Traversing Dynamic s-Pareto Frontiers." BYU ScholarsArchive, 2012. https://scholarsarchive.byu.edu/etd/3486.
Full textAbstract:
The use of multiobjective optimization in identifying systems that account for changes in customer needs, operating environments, system design concepts, and analysis models over time is generally not explored. Providing solutions that anticipate, account for, and allow for these changes over time is a significant challenge to manufacturers and design engineers. Products that adapt to these changes through the addition and/or subtraction of modules can reduce production costs through product commonality, and cater to customization and adaptation. In terms of identifying sets of non-dominated designs, these changes result in the concept of dynamic Pareto frontiers, or dynamic s-Pareto frontiers when sets of system concepts are simultaneously evaluated over time. In this dissertation, a five-step optimization-based design method identifying a set of optimal adaptive product designs that satisfy the predicted changes by moving from one location on the dynamic s-Pareto frontier to another through the addition of a module and/or through reconfiguration is developed. Development of this five-step method was separated into four phases. The first two phases of developments respectively focus on Pareto and s-Pareto cases, where changes in concepts, models, and environments that would effect the Pareto/s-Pareto frontier are ignored due to limitations in traditional optimization problem formulations. To overcome these limitations, and allow for these changes, the third phase of developments presents a generic optimization formulation capable of identifying a dynamic s-Pareto frontier, while the fourth phase adapts the phase three method to incorporate this new dynamic optimization formulation. Example implementations of the four phases of developments were respectively provided through the design of a modular UAV, a hurricane and flood resistant modular residential structure, a simple aircraft design example inspired by the Lockheed C-130 Hercules, and a modular truss system. Noting that modular products only represent one approach for dealing with changes in preferences, environments, models, and concepts, the final research contribution connects the presented method with parallel research developments in collaborative product design and design principles identification, followed by two case study implementations of this unifying design approach in the development of a modular irrigation pump and a modular plywood cart for developing countries.
50
Bello, Enrico <1994>. "L'expected shortfall come misura di rischio in ambito Pareto stabile." Master's Degree Thesis, Università Ca' Foscari Venezia, 2019. http://hdl.handle.net/10579/14507.
Full text