Дисертації: "Bounded theory"

1

Mavra, Boris. "Bounded geometry index theory." Thesis, University of Oxford, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.318820.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Wienhard, Anna Katharina. "Bounded cohomology and geometry." Bonn : Mathematisches Institut der Universität, 2004. http://catalog.hathitrust.org/api/volumes/oclc/62768224.html.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Strömberg, Roland. "Spectral Theory for Bounded Self-adjoint Operators." Thesis, Uppsala University, Department of Mathematics, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-121364.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Heckman, Christopher Carl. "Independent sets in bounded degree graphs." Diss., Georgia Institute of Technology, 2000. http://hdl.handle.net/1853/29163.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

5

Pallekonda, Seshendra. "Bounded category of an exact category." Diss., Online access via UMI:, 2008.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

6

Seabright, Paul. "Bounded beliefs and Keynesian speculation." Thesis, University of Oxford, 1987. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.328011.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

7

Köhler, Jonathan Hugh. "Bounded rationality in savings decisions." Thesis, University of York, 1996. http://etheses.whiterose.ac.uk/10878/.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

8

Reina, Livia. "From Subjective Expected Utility Theory to Bounded Rationality." Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2006. http://nbn-resolving.de/urn:nbn:de:swb:14-1140624885934-50567.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

As mentioned in the introduction, the objective of this work has been to get a more realistic understanding of economic decision making processes by adopting an interdisciplinary approach which takes into consideration at the same time economic and psychological issues. The research in particular has been focused on the psychological concept of categorization, which in the standard economic theory has received until now no attention, and on its implications for decision making. The three experimental studies conducted in this work provide empirical evidence that individuals don not behave according to the perfect rationality and maximization assumptions which underly the SEUT, but rather as bounded rational satisfiers who try to simplify the decision problems they face through the process of categorization. The results of the first experimental study, on bilateral integrative negotiation, show that most of the people categorize a continuum of outcomes in two categories (satisfying/not satisfying), and treat all the options within each category as equivalent. This process of categorization leads the negotiators to make suboptimal agreements and to what I call the ?Zone of Agreement Bias? (ZAB). The experimental study on committees? decision making with logrolling provides evidence of how the categorization of outcomes in satisfying/not satisfying can affect the process of coalition formation in multi-issue decisions. In the first experiment, involving 3-issues and 3-parties decisions under majority rule, the categorization of outcomes leads most of the individuals to form suboptimal coalitions and make Pareto-dominated agreements. The second experiment, aimed at comparing the suboptimizing effect of categorization under majority and unanimity rule, shows that the unanimity rule can lead to a much higher rate of optimal agreements than the majority rule. The third experiment, involving 4-issues and 4-parties decisions provides evidence that the results of experiments 1 and 2 hold even when the level of complexity of the decision problem increases.

9

Kneeland, Terri. "Bounded rationality in games : theory, experiments, and applications." Thesis, University of British Columbia, 2013. http://hdl.handle.net/2429/44573.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

This dissertation combines three contributions to the literature on bounded rationality in games. The aim of this thesis is to improve our understanding of how individuals make decisions in games, improve our ability to model this behavior and increase our understanding of how bounded rationality affects predictions, policy and optimal mechanisms. The first paper is an application of a boundedly rational model to explain behavior in coordinated attack games. I demonstrate that the main experimental results, such as threshold strategies, comparative statics, and the differences in behavior under public and private information, are robust predictions of limited depth of reasoning models. This is in contrast to equilibrium, which mispredicts the coordinating roles of the different types of information. The analysis has implications for macroeconomic phenomena, like currency attacks and debt crises, which are commonly modeled using incomplete information coordinated attack games. The second paper explores policy and optimal mechanism design under bounded rationality. Level-k implementation is contrasted with the more standard Bayesian implementation concept. I show that the revelation principle holds with an augmented message space and that level-k implementation is a weaker solution concept. In addition, level-k implementation is possible in a mechanism that is robust to different specifications of beliefs about depths of reasoning or to any specification of beliefs about payoffs. The third paper takes a step back from assuming a particular solution concept and investigates empirical features of strategic reasoning in the lab. I employ strategic choice data from a carefully chosen set of ring games to obtain individual-level estimates of the following three epistemic conditions: rationality, beliefs about the rationality of others, and consistent beliefs. I find that not a single subject satisfies all three of the epistemic conditions sufficient for Nash equilibrium and that consistent beliefs, rather than rationality, is the more likely source for the failure of Nash equilibrium. The design allows us to weight the relative plausibility of alternative solution concepts used to explain laboratory results.

10

Jones, Matthew Thomas. "Essays on Bounded Rationality in Applied Game Theory." The Ohio State University, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=osu1337782631.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

11

Yi, Hyun Chang. "Essays in economic theory." Thesis, University of Exeter, 2014. http://hdl.handle.net/10871/15246.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

This dissertation consists of three research papers on cheap talk game and satisficing behaviour. The first chapter examines the potential for communication via cheap talk between an expert and a decision maker whose type (preferences) is uncertain. The expert privately observes states for each type of the decision maker and wants to persuade the decision maker to choose an action in his favour by informing her of the states. The decision maker privately observes her type and chooses an action. An optimal action for the decision maker depends upon both her type and type-specific states. In equilibrium the expert can always inform the decision maker in the form of comparative statements and the decision maker also can partially reveal her type to the expert or public. The second and third chapters build a dynamic model of satisficing behaviour in which an agent’s “expected” payoff is explicitly introduced, where this expectation is adaptively formed. If the agent receives a payoff above her satisficing level she continues with the current action, updating her valuation of the action. If she receives a payoff below her satisficing level and her valuation falls below her satisficing level she updates both her action and satisficing level. In the second chapter, we find that in the long run, all players satisfice. In individual decision problems, satisficing behaviour results in cautious, maximin choice and in normal form games like the Prisoner’s Dilemma and Stag Hunt, they in the long run play either cooperative or defective outcomes conditional on past plays. In coordination games like the Battle of the Sexes, Choosing Sides and Common Interest, they in the long run coordinate on Pareto optimal outcomes. In the third chapter, we find that satisficing players in the long run play subgame dominant paths, which is a refinement of subgame perfection, and identify conditions with which they ‘always cooperate’ or ‘fairly coordinate’ in repeated Prisoner’s Dilemma and Battle of the Sexes games, respectively, and truthfully communicate in sender-receiver games. Proofs and simulations are provided in appendices.

12

Smith, Justin N. "Computational complexity, bounded rationality and the theory of games." Thesis, University of Oxford, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.365642.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

13

Baker, Joseph O., Christopher D. Bader, and F. Carson Mencken. "A Bounded Affinity Theory of Religion and the Paranormal." Digital Commons @ East Tennessee State University, 2016. https://dc.etsu.edu/etsu-works/500.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

We outline a theory of bounded affinity between religious experiences and beliefs and paranormalism, which emphasizes that religious and paranormal experiences and beliefs share inherent physiological, psychological, and ontological similarities. Despite these parallels, organized religious groups typically delineate a narrow subset of experiences and explanatory frames as acceptable and True, banishing others as either false or demonic. Accordingly, the theory provides a revised definition of the “paranormal” as beliefs and experiences explicitly rejected by science and organized religions. To demonstrate the utility of the theory, we show that, after controlling for levels of conventional religious practice, there is a strong, positive relationship between claiming Christian-based religious experiences and believing in, pursuing, and experiencing the paranormal, particularly among individuals not strongly tethered to organized religion. Bounded affinity theory makes sense of recent non-linear and complex moderation findings in the empirical literature and reiterates the importance of the paranormal for studies of religion.

14

Wu, Dong-Nan. "Active bounded-state vibration control for structural applications." Diss., Georgia Institute of Technology, 1995. http://hdl.handle.net/1853/12326.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

15

Georgiou, Phokion 'Ion' Sotirios. "Dogmatism and bounded rationality : a systemic epistemology for system theory." Thesis, Lancaster University, 2004. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.420564.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

16

Chis, Cristina. "Bounded sets in topological groups." Doctoral thesis, Universitat Jaume I, 2010. http://hdl.handle.net/10803/10502.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

A boundedness structure (bornology) on a topological space is an ideal of subsets containing all singletons, that is, closed under taking subsets and unions of finitely many elements. In this paper we deal with the structure of the whole family of bounded subsets rather than the specific properties of them by means of certain functions that we define on a metrizable topological group. Our motivation is twofold: on the one hand, we obtain useful information about the structural features of certain remarkable classes of bounded systems, cofinality, local properties, etc. For example, we estimate the cofinality of these boundedness notions.
In the second part of the paper, we apply duality methods in order to obtain estimations of the size of a local base for an important class of groups. This translation, which has been widely exhibited in the Pontryagin-van Kampen duality theory of locally compact abelian groups, is often very relevant and has been extended by many authors to more general classes of topological groups. In this work we follow basically the pattern and terminology given by Vilenkin in 1998.

17

Dawson, Dan Paul. "Concerning Integral Approximations of Bounded Finitely Additive Set Functions." Thesis, University of North Texas, 1992. https://digital.library.unt.edu/ark:/67531/metadc332650/.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

The purpose of this paper is to generalize a theorem that characterizes absolute continuity of bounded finitely additive set functions in the form of an integral approximation. We show that his integral exists if the condition of absolute continuity is removed.

18

Ilg, Matthias. "An investigation of spatially bounded, time independent quantum systems." Thesis, Georgia Institute of Technology, 1991. http://hdl.handle.net/1853/28046.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

19

Casas, i. Klett Tomas. "K-efficiency theory of entrepreneurship : random payoffs, biases and bounded luck /." [St. Gallen] : [s.n.], 2005. http://www.gbv.de/dms/zbw/503222127.pdf.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

20

Goosen, Gerrit. "Relational representations for bounded lattices with operators." Thesis, Stellenbosch : University of Stellenbosch, 2010. http://hdl.handle.net/10019.1/4343.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

Thesis (MSc (Mathematics))--University of Stellenbosch, 2010.
ENGLISH ABSTRACT: Within lattice theory, an interesting question asked is whether a given abstract lattice may be represented concretely as subsets of a closure system on a topological space. This is true for boolean algebras, bounded distributive lattices and arbitrary bounded lattices. In particular, there are a multitude of ways to represent bounded lattices. We present some of these ideas, as well as an analysis of the differences between them. We further investigate the attempts that were made to extend the above representations to lattices endowed with operators, in particular the work done on bounded distributive lattices with operators. We then make a new contribution by extending this work to arbitrary bounded lattices with operators. We also show that the so-called sufficiency operator has a relational representation in the bounded lattice case.
AFRIKAANSE OPSOMMING: Binne die raamwerk van tralie teorie word die vraag soms gevra of ’n gegewe tralie konkreet veteenwoordig kan word as subversamelings van ’n afsluitingssisteem op ’n topologiese ruimte. Die voorgenoemde is waar vir, onder andere, boolse algebras, begrensde distributiewe tralies en algemene begrensde tralies. Daar is veral vir begrensde tralies menigte maniere om hul te verteenwoordig. Ons bied sommige van hierdie idees voor, asook ’n analiese van die verskille daarin teenwoordig. Verder ondersoek ons ook sommige van die maniere waarop tralies tesame met operatore verteenwoordig kan word. Ons sal spesiale aandag gee aan distributiewe tralies met operatore, soos gedoen in, met die idee om die voorgenoemde uit te brei na algemene begrensde tralies met operatore. Ons toon dan verder aan dat die sogenoemde voldoende operator ook ’n relasionele verteenwoordiging het in die begrensde tralie geval.

21

Roomets, Alex Wagner. "Testing and Refining Strategic Decision Theory." Diss., The University of Arizona, 2011. http://hdl.handle.net/10150/202513.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

In many important economic situations, decision makers influence each other. The subject of game theory offers a mathematical framework to describe such strategic interaction. This dissertation focuses largely on helping to answering the question,"What will someone do in a particular strategic situation?" In order to do this, it is useful to interweave theory with experimentation. After all, observation of what people really do is a necessity when attempting to create models of what people really do. At the same time, theory can help significantly when formulating interesting hypotheses to test. The chapters in my dissertation illustrate this interweaving of theory and experiments.

22

Shan, Xu Yi. "Bounded feedback and structural issues in linear multivariable systems." Thesis, City University London, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.316131.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

23

Rossi, Louis Frank, and Louis Frank Rossi. "A spreading blob vortex method for viscous bounded flows." Diss., The University of Arizona, 1993. http://hdl.handle.net/10150/186562.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

In this dissertation, I introduce a vortex method that is generally applicable to any two-dimensional, incompressible flow with or without boundaries. This method is deterministic, accurate, convergent, naturally adaptive, geometry independent and fully localized. For viscous flows, the vorticity distribution of each vortex element must evolve in addition to following a Lagrangian trajectory. My method relies upon an idea called core spreading. Core spreading is inconsistent by itself, but I have corrected it with a deterministic process known as "vortex fission" where one "fat" vortex is replaced by several "thinner" ones. Also, I examine rigorously a method for merging many blobs into one. This process maintains smaller problem sizes thus boosting the efficiency of the vortex method. To prove that this corrected core spreading method will converge uniformly, I adapted a continuous formalism to this grid-free scheme. This convergence theory does not rely on any form of grid. I only examine the linear problem where the flow field is specified, and treat the full nonlinear problem as a perturbation of the linear problem. The estimated rate of convergence is demonstrated to be sharp in several examples. Boundary conditions are approximated indirectly. The boundary is decomposed into a collection of small linear segments. I solve the no-slip and no-normal flow conditions simultaneously by superimposing a potential flow and injecting vorticity from the boundary consistent with the unsteady Rayleigh problem. Finally, the ultimate test for this new method is to simulate the wall jet. The simulations produce a dipole instability along the wall as observed in water tank and wind tunnel experiments and predicted by linear stability analysis. Moreover, the wavelength and height of these simulations agree quantitatively with experimental observations.

24

Iourtchenko, Daniil V. "Optimal bounded control and relevant response analysis for random vibrations." Link to electronic thesis, 2001. http://www.wpi.edu/Pubs/ETD/Available/etd-0525101-111407.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

Thesis (Ph. D.)--Worcester Polytechnic Institute.
Keywords: Stochastic optimal control; dynamic programming; Hamilton-Jacobi-Bellman equation; Random vibration. Keywords: Stochastic optimal control; dynamic programming; Hamilton-Jacobi-Bellman equation; Random vibration; energy balance method. Includes bibliographical references (p. 86-89).

25

Wang, Xin. "Bounded Multiattribute Utility in Behavioral Decision Research: Theory, Estimation and Experimental Tests." University of Cincinnati / OhioLINK, 2014. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1406821794.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

26

Fukihara, Yoji. "Generalization of Bounded Linear Logic and its Categorical Semantics." Doctoral thesis, Kyoto University, 2021. http://hdl.handle.net/2433/263441.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

27

Merz, Florian [Verfasser], and C. [Akademischer Betreuer] Sinz. "Theory and Implementation of Software Bounded Model Checking / Florian Merz ; Betreuer: C. Sinz." Karlsruhe : KIT-Bibliothek, 2016. http://d-nb.info/1122461615/34.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

28

Turcu, George R. "Hypercyclic Extensions Of Bounded Linear Operators." Bowling Green State University / OhioLINK, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=bgsu1386189984.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

29

Allen, Robert Francis. "A class of operators with symbol on the bloch space of a bounded homogeneous domain." Fairfax, VA : George Mason University, 2009. http://hdl.handle.net/1920/4541.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

Thesis (Ph.D.)--George Mason University, 2009.
Vita: p. 158. Thesis director: Flavia Colonna. Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Mathematics. Title from PDF t.p. (viewed Oct. 11, 2009). Includes bibliographical references (p. 150-157). Also issued in print.

30

Lee, Penagos Luis Alejandro. "Understanding behaviour through the lens of bounded rationality : experiments with human and artificial agents." Thesis, University of Nottingham, 2017. http://eprints.nottingham.ac.uk/42418/.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

31

HELMICK, MICHAEL T. "EFFICIENT GROUP COMMUNICATION AND THE DEGREE-BOUNDED SHORTEST PATH PROBLEM." University of Cincinnati / OhioLINK, 2007. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1178810750.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

32

Zhang, Luyao. "Bounded Rationality and Mechanism Design." The Ohio State University, 2018. http://rave.ohiolink.edu/etdc/view?acc_num=osu1532692312980569.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

33

Cao, Cung Economics Australian School of Business UNSW. "Asymmetric and imperfect knowledge: a proposal to replace unbounded rationality with bounded rationality." Awarded by:University of New South Wales. School of Economics, 2007. http://handle.unsw.edu.au/1959.4/27025.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

The purpose of this thesis is to illustrate how the role of knowledge may be the missing link in economics and to argue that the assumption of unbounded rationality, which underpinned neoclassical economics, should be replaced by bounded rationality and that bounded rationality should be redefined as people are rational, but are constrained by asymmetric and imperfect knowledge. This decomposition of bounded rationality makes it possible for us to operationalize bounded rationality, which was founded by Herbert Simon in the 1950s, but has not been widely adopted in economics because the concept was considered too difficult to formalize. The inclusion of asymmetric and imperfect knowledge considerations in microeconomics provides new insights into the existence and boundaries of firms, the role and nature of institutions, financial market inefficiency and political choices. The inclusion of asymmetric knowledge considerations in macroeconomics can help explain the unequal distribution of wealth between individuals, firms and nations. A lack of knowledge, and the difficulties in overcoming a lack of knowledge, can help to explain aspects of economic fluctuations, prices rigidities, monetary non-neutrality and unemployment. Most importantly, when the role of knowledge is considered, it provides better explanations to various anomalies in economics, helps reconciles differences between various theories and may opens up the possibility of unifying various schools of economic thought.

34

Watson, Philip David. "The theory of cutting and packing of non-interlocking shapes in a bounded region." Thesis, University of Birmingham, 1997. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.752400.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

35

Modarres-Mousavi, Shabnam. "Methodological Foundations for Bounded Rationality as a Primary Framework." Diss., Virginia Tech, 2002. http://hdl.handle.net/10919/30225.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

Experimental observations have shown that economic agents behave in ways different from the maximization of any utility function. Herbert Simon sought to deal with this by positing that individuals do not maximize, but rather "satisfice." This was a radical departure from the traditional economic framework, and one that still has not been adequately formalized. But Simon's suggestion is only the smallest part of what is needed for a theory that reflects the actual behavior. For instance, Simon's framework cannot deal with the observation that the act of choice changes the chooser. This dissertation is further developing Simon's original ideas through embracing John Dewey's transactional thinking to attain an adequate theory of economic choice that accounts for boundedly rational agents. I clarify that substantive rationality and bounded (procedural) rationality share the same basic utilitarian assumption of predetermined goals. In terms of a Deweyan (transactional) analysis, the idea of utilitarian "optimization" ultimately guides and constrains both theories. But empirical study of choice behavior and the behavior of subjects in experimental laboratories, both indicate that neither substantive nor procedural rationality can effectively account for actual economic choices. I emphasize the importance of treating bounded rationality without reference to the rational framework. To me, bounded rationality implies a realistic picture of behavior, which is associated with emerging goals and not ones that exist prior to the making of a choice. I consider uncertainty as a normal characteristic of the situation, which in turn allows consideration of acting based on inconsistent information, just as people actually do. The basis of a systematic approach to behavior that can capture inconsistency is developed by Tom Burke. He mathematizes Dewey's logic. He allows for impossible worlds in the set of states. Thus, not only can the initial state space hold inconsistent states, the information set can include mutually inconsistent elements. So the current neoclassical paradigm resembles the representative realism, but is there any good reason why we should accept this methodology as economists? Whatever one's ultimate metaphysics and epistemology, I want to show that an alternative approach to economic decision-making may prove highly useful in theory and practice.
Ph. D.

36

Lu, Lei 1975. "Essays on asset pricing with heterogeneous beliefs and bounded rational investor." Thesis, McGill University, 2007. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=103267.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

The thesis includes two essays on asset pricing. In the first essay, "Asset Pricing in a Monetary Economy with Heterogeneous Beliefs", we shed new light on the role of monetary policy in asset pricing by focusing on the case where investors have heterogeneous expectations about future monetary policy. Under heterogeneity in beliefs, investors place bets against each other on the evolution of money supply, and as a result, the sharing of wealth in the economy evolves stochastically over time, making money non-neutral. Employing a continuous-time, general equilibrium model, we establish these fluctuations to be rich in implications, in that they majorly affect the equilibrium prices of all assets, as well as inflation. In particular, we find that the stock market volatility may be significantly increased by the heterogeneity in beliefs, a conclusion supported by our empirical analysis. The second essay is titled with " Asset Pricing and Welfare Analysis with Bounded Rational Investors". Motivated by the fact that investors have limited ability and insufficient knowledge to process information, I model investors' bounded-rational behavior in processing information and study its implications on asset pricing. Bounded rational investors perceive "correlated" information (which consists of news that is correlated with fundamentals, but provides no information on them) as "fundamental" information. This generates "bounded rational risk". Asset prices and volatilities of asset returns are derived. Specially, the equity premium and the stock volatility are raised under some conditions. I also analyze the welfare impact of bounded rationality.

37

Hussein, Amru [Verfasser]. "Spectral theory of differential operators on finite metric graphs and on bounded domains / Amru Hussein." Mainz : Universitätsbibliothek Mainz, 2013. http://d-nb.info/1041292287/34.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

38

Sanjab, Anibal Jean. "Security of Cyber-Physical Systems with Human Actors: Theoretical Foundations, Game Theory, and Bounded Rationality." Diss., Virginia Tech, 2018. http://hdl.handle.net/10919/86204.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

Cyber-physical systems (CPSs) are large-scale systems that seamlessly integrate physical and human elements via a cyber layer that enables connectivity, sensing, and data processing. Key examples of CPSs include smart power systems, smart transportation systems, and the Internet of Things (IoT). This wide-scale cyber-physical interconnection introduces various operational benefits and promises to transform cities, infrastructure, and networked systems into more efficient, interactive, and interconnected smart systems. However, this ubiquitous connectivity leaves CPSs vulnerable to menacing security threats as evidenced by the recent discovery of the Stuxnet worm and the Mirai malware, as well as the latest reported security breaches in a number of CPS application domains such as the power grid and the IoT. Addressing these culminating security challenges requires a holistic analysis of CPS security which necessitates: 1) Determining the effects of possible attacks on a CPS and the effectiveness of any implemented defense mechanism, 2) Analyzing the multi-agent interactions -- among humans and automated systems -- that occur within CPSs and which have direct effects on the security state of the system, and 3) Recognizing the role that humans and their decision making processes play in the security of CPSs. Based on these three tenets, the central goal of this dissertation is to enhance the security of CPSs with human actors by developing fool-proof defense strategies founded on novel theoretical frameworks which integrate the engineering principles of CPSs with the mathematical concepts of game theory and human behavioral models. Towards realizing this overarching goal, this dissertation presents a number of key contributions targeting two prominent CPS application domains: the smart electric grid and drone systems. In smart grids, first, a novel analytical framework is developed which generalizes the analysis of a wide set of security attacks targeting the state estimator of the power grid, including observability and data injection attacks. This framework provides a unified basis for solving a broad set of known smart grid security problems. Indeed, the developed tools allow a precise characterization of optimal observability and data injection attack strategies which can target the grid as well as the derivation of optimal defense strategies to thwart these attacks. For instance, the results show that the proposed framework provides an effective and tractable approach for the identification of the sparsest stealthy attacks as well as the minimum sets of measurements to defend for protecting the system. Second, a novel game-theoretic framework is developed to derive optimal defense strategies to thwart stealthy data injection attacks on the smart grid, launched by multiple adversaries, while accounting for the limited resources of the adversaries and the system operator. The analytical results show the existence of a diminishing effect of aggregated multiple attacks which can be leveraged to successfully secure the system; a novel result which leads to more efficiently and effectively protecting the system. Third, a novel analytical framework is developed to enhance the resilience of the smart grid against blackout-inducing cyber attacks by leveraging distributed storage capacity to meet the grid's critical load during emergency events. In this respect, the results demonstrate that the potential subjectivity of storage units' owners plays a key role in shaping their energy storage and trading strategies. As such, financial incentives must be carefully designed, while accounting for this subjectivity, in order to provide effective incentives for storage owners to commit the needed portions of their storage capacity for possible emergency events. Next, the security of time-critical drone-based CPSs is studied. In this regard, a stochastic network interdiction game is developed which addresses pertinent security problems in two prominent time-critical drone systems: drone delivery and anti-drone systems. Using the developed network interdiction framework, the optimal path selection policies for evading attacks and minimizing mission completion times, as well as the optimal interdiction strategies for effectively intercepting the paths of the drones, are analytically characterized. Using advanced notions from Nobel-prize winning prospect theory, the developed framework characterizes the direct impacts of humans' bounded rationality on their chosen strategies and the achieved mission completion times. For instance, the results show that this bounded rationality can lead to mission completion times that significantly surpass the desired target times. Such deviations from the desired target times can lead to detrimental consequences primarily in drone delivery systems used for the carriage of emergency medical products. Finally, a generic security model for CPSs with human actors is proposed to study the diffusion of threats across the cyber and physical realms. This proposed framework can capture several application domains and allows a precise characterization of optimal defense strategies to protect the critical physical components of the system from threats emanating from the cyber layer. The developed framework accounts for the presence of attackers that can have varying skill levels. The results show that considering such differing skills leads to defense strategies which can better protect the system. In a nutshell, this dissertation presents new theoretical foundations for the security of large-scale CPSs, that tightly integrate cyber, physical, and human elements, thus paving the way towards the wide-scale adoption of CPSs in tomorrow's smart cities and critical infrastructure.
Ph. D.
Enhancing the efficiency, sustainability, and resilience of cities, infrastructure, and industrial systems is contingent on their transformation into more interactive and interconnected smart systems. This has led to the emergence of what is known as cyber-physical systems (CPSs). CPSs are widescale distributed and interconnected systems integrating physical components and humans via a cyber layer that enables sensing, connectivity, and data processing. Some of the most prominent examples of CPSs include the smart electric grid, smart cities, intelligent transportation systems, and the Internet of Things. The seamless interconnectivity between the various elements of a CPS introduces a wealth of operational benefits. However, this wide-scale interconnectivity and ubiquitous integration of cyber technologies render CPSs vulnerable to a range of security threats as manifested by recently reported security breaches in a number of CPS application domains. Addressing these culminating security challenges requires the development and implementation of fool-proof defense strategies grounded in solid theoretical foundations. To this end, the central goal of this dissertation is to enhance the security of CPSs by advancing novel analytical frameworks which tightly integrate the cyber, physical, and human elements of a CPS. The developed frameworks and tools enable the derivation of holistic defense strategies by: a) Characterizing the security interdependence between the various elements of a CPS, b) Quantifying the consequences of possible attacks on a CPS and the effectiveness of any implemented defense mechanism, c) Modeling the multi-agent interactions in CPSs, involving humans and automated systems, which have a direct effect on the security state of the system, and d) Capturing the role that human perceptions and decision making processes play in the security of CPSs. The developed tools and performed analyses integrate the engineering principles of CPSs with the mathematical concepts of game theory and human behavioral models and introduce key contributions to a number of CPS application domains such as the smart electric grid and drone systems. The introduced results enable strengthening the security of CPSs, thereby paving the way for their wide-scale adoption in smart cities and critical infrastructure.

39

Mubeen, Faizalam Junaid. "The bounded H∞ calculus for sectorial, strip-type and half-plane operators." Thesis, University of Oxford, 2011. https://ora.ox.ac.uk/objects/uuid:6bff352d-f858-492a-a00b-3a3dd2049b5c.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

The main study of this thesis is the holomorphic functional calculi for three classes of unbounded operators: sectorial, strip-type and half-plane. The functional calculus for sectorial operators was introduced by McIntosh as an extension of the Riesz-Dunford model for bounded operators. More recently Haase has developed an abstract framework which incorporates analogous constructions for strip-type and half-plane operators. These operators are of interest since they arise naturally as generators of C₀-(semi)groups. The theory of bounded H^∞-calculus for sectorial operators is well established and it has been found to have many applications in operator theory and parabolic evolution equations. We survey these known results, first on Hilbert space and then on general Banach space. Our main goal is to fill the gaps in the parallel theory for strip-type operators. Whilst some of this can be deduced by taking exponentials and applying known results for sectorial operators, in general this is insu_cient to obtain our desired results and so we pursue an independent approach. Starting on Hilbert space, we broaden known characterisations of the bounded H^∞-calculus for strip-type operators by introducing a notion of absolute calculus which is an analogue to the established notion for the sectorial case. Moving to general Banach space, we build on the work of Vörös, broadening his characterisation for strip-type operators in terms of weak integral estimates by introducing a new, but equivalent, notion of the bounded H^∞-calculus, which we call the m-bounded calculus. We also demonstrate that these characterisations fail for half-plane operators and instead present a weaker form of the bounded H-calculus which is more natural for these operators. This allows us to obtain new and simple proofs of well known generation theorems due to Gomilko and Shi-Feng, with extensions to polynomially bounded semigroups. The connection between the bounded H-calculus of semigroup generators and polynomial boundedness of their associated Cayley Transforms is also explored. Finally we present a series of results on sums of operators, in connection with maximal regularity. We also establish stability results for the bounded H^∞-calculus for strip-type operators by showing it is preserved under suitable bounded perturbations, which at time requires further assumptions on the underlying Banach space. This relies heavily on intermediate characterisations of the bounded H^∞-calculus due to Kalton and Weis.

40

Kaye-Blake, William Henry. "Demand for genetically modified food : theory and empirical findings." Phd thesis, Lincoln University. Commerce Division, 2006. http://theses.lincoln.ac.nz/public/adt-NZLIU20060913.102217.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

As economies develop, novel products are created and markets for these products arise. Genetically modified food (GMF) is an example of such a novel product and provides economists with the opportunity to investigate an infant market. Of particular interest with GMF is the impact of consumer reactions on the market. The response of consumers to GMF and their willingness to pay for it has emerged as an important factor in the development of this technology. This research investigates these consumer responses. Prior research suggests that two aspects of consumer behaviour may be relevant for the GMF market. First, consumers may react differently to different types of GMF, so that some products are potentially more economically viable. Secondly, some consumers appear to prefer not having GMF at all. Consumer behaviour is often framed according to neoclassical economic theory. Consumer preferences over goods and the attributes of those goods are generally held to have certain properties. The aspects of consumers reactions to GMF noted above, however, may be in conflict with two properties of preferences in neoclassical theory. First, preferences over food attributes are not separable, but may interact with each other. Secondly, some consumers may have preferences regarding GMF that are not continuous. As a result, aggregate impacts of introducing GMF may be difficult to measure, which raises a third issue for investigation, aggregation. Finally, an alternative model of consumer behaviour is bounded rationality, which theorises that choices may be discontinuous as a result of specific protocols. It also suggests that consumers seek to make good-enough choices, rather than attempting to maximise their satisfaction. Thus, optimisation or maximisation is the fourth issue considered in this thesis. In order to investigate these properties of consumers preferences, a choice experiment survey was developed. The strength of a choice experiment for examining these issues is its focus on the impact of each product attribute on a respondents choices. Thus, it may be possible to identify potentially discontinuous choice patterns and to identify choices affected by interactions between GM technology and other food attributes. Results from a neoclassical analysis of the survey data suggest that some consumers consider the type of benefit created with GM technology in making their choices. In addition, one-quarter to one-half of respondents may have had discontinuous preferences with respect to GMF. Reactions to GMF appear related to respondents attitudes, but not to socio-economic or demographic descriptors. As a result, aggregate measures of the impact of GMF may not fully account for consumers responses. A boundedly rational model also has reasonable goodness of fit, and may provide a different perspective on consumer behaviour. It is hoped that the results of this research provide a better understanding of consumer behaviour regarding GMF and, by extension, of the process of consumer adoption of novel products. It is further hoped that this attempt to incorporate choice protocols into discrete choice analysis will provide a useful example for further research.

41

Reinwand, Simon [Verfasser], Jürgen [Gutachter] Appell, Daria [Gutachter] Bugajewska, and Gianluca [Gutachter] Vinti. "Functions of Bounded Variation: Theory, Methods, Applications / Simon Reinwand ; Gutachter: Jürgen Appell, Daria Bugajewska, Gianluca Vinti." Würzburg : Universität Würzburg, 2021. http://d-nb.info/1232647632/34.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

42

Hokamp, Samuel A. "Weak*-Closed Unitarily and Moebius Invariant Spaces of Bounded Measurable Functions on a Sphere." Bowling Green State University / OhioLINK, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=bgsu1562943150719334.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

43

Ryan, Mark Joseph 1978. "A Satisficing Model of Consumer Behavior." Thesis, University of Oregon, 2011. http://hdl.handle.net/1794/12095.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

xiii, 230 p. : ill. (some col.)
I develop a model in which a representative consumer selects an affordable consumption bundle, not as a single choice, but as the end result of a series of smaller, incremental purchase decisions. If the array of such incremental choices facing the consumer is sufficiently complex relative to the consumer's computational abilities, then the consumer may choose to employ a simplifying heuristic or rule-of-thumb to guide her behavior. I demonstrate the existence of a simple and well-defined example of such a strategy, based upon a satisficing decision rule. I further show that in the strategic setting defined by the interaction between consumers and firms that compete in prices, this satisficing strategy can form part of a Nash equilibrium, despite being ex ante only boundedly rational. The use of this satisficing demand strategy fundamentally alters the nature of price competition between firms (relative to the standard Bertrand model), changing the shape of the firm best response functions. The use of a satisficing strategy alters the incentives of firms, and these altered firm incentives lead to pricing behavior which has the effect of rationalizing the satisficing consumption strategy, so that a truly novel class of Nash equilibria in price-competing markets can be shown to exist under certain conditions. We explore the nature of this new class of equilibria, and find that equilibrium prices may be higher than those which would be obtained in the standard Bertrand case. In general, demand curves for each distinct good will have a kinked shape, similar to those found in 1939 papers by both Sweezy and Hall & Hitch. The Nash equilibrium profile will involve the kink in each demand curve coinciding with the equilibrium price for the corresponding good. The equilibrium price vector will therefore be robust to "small" fluctuations in cost (since marginal revenue is discontinuous at the equilibrium price), and under certain conditions, we find that prices may be upwardly flexible but downwardly rigid. We make an argument that the main results of the paper generalize from a representative agent setting to one with a population of heterogeneous consumers.
Committee in charge: Dr. Van Kolpin， Chairperson； Dr. Christopher J. Ellis， Member； Dr. Jeremy Piger， Member； Dr. Renee Irvin， Outside Member

44

Velez, John A. "A Test of Bounded Generalized Reciprocity and Social Identity Theory in a Social Video Game Play Context." The Ohio State University, 2014. http://rave.ohiolink.edu/etdc/view?acc_num=osu1397671422.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

45

Calhoun, Charles Wesley. "Nonprofit Organizational Sustainability in Bounded Contexts: A Case Study on an Appalachian Arts Organization." The Ohio State University, 2017. http://rave.ohiolink.edu/etdc/view?acc_num=osu1499258798712498.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

46

Dafnos, Stavros. "Five essays in applied economic theory and times series econometrics with applications to accounting and economics." Thesis, Brunel University, 2017. http://bura.brunel.ac.uk/handle/2438/15618.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

We employ some of the modern tools of economic theory and time series econometrics to consider a number of economic problems. The communication and coordination problems we study are relevant in accounting, business, economics and finance. The thesis begins by examining the behaviour of people and organisations, who are supposed to share a common goal. Then it considers the equilibriating mechanisms of behaviour by groups of economic agents, who usually have conflicting interests. We apply the tools of non-cooperative game theory, which constitutes a large part of modern economic theory. In the sequel, we address the question of why people behave the way they do in their economic a↵airs. Peoples' economic behaviour is mirrored in the aggregates of macroeconomics. We propose a Time Varying Autoregressive model to study the movements in the five main macroeconomic variables. The methods come from standard Time Series Analysis, but we do introduce some innovative time series techniques. Finally, we conduct an empirical investigation of the movements in one of the five main macroeconomic variables, the rate of inflation. Among the econometric tools employed are standard Autoregressive models (AR), Autoregressive Distributed Lag models (ADL) and the more recent Generalised Autoregressive Conditional Heteroskedasticity (GARCH) methodology.

47

Heimberg, Lucas. "Complexity of Normal Forms on Structures of Bounded Degree." Doctoral thesis, Humboldt-Universität zu Berlin, 2018. http://dx.doi.org/10.18452/19205.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

Normalformen drücken semantische Eigenschaften einer Logik durch syntaktische Restriktionen aus. Sie ermöglichen es Algorithmen, Grenzen der Ausdrucksstärke einer Logik auszunutzen. Ein Beispiel ist die Lokalität der Logik erster Stufe (FO), die impliziert, dass Graph-Eigenschaften wie Erreichbarkeit oder Zusammenhang nicht FO-definierbar sind. Gaifman-Normalformen drücken die Bedeutung einer FO-Formel als Boolesche Kombination lokaler Eigenschaften aus. Sie haben eine wichtige Rolle in Model-Checking Algorithmen für Klassen dünn besetzter Graphen, deren Laufzeit durch die Größe der auszuwertenden Formel parametrisiert ist. Es ist jedoch bekannt, dass Gaifman-Normalformen im Allgemeinen nur mit nicht-elementarem Aufwand konstruiert werden können. Dies führt zu einer enormen Parameterabhängigkeit der genannten Algorithmen. Ähnliche nicht-elementare untere Schranken sind auch für Feferman-Vaught-Zerlegungen und für die Erhaltungssätze von Lyndon, Łoś und Tarski bekannt. Diese Arbeit untersucht die Komplexität der genannten Normalformen auf Klassen von Strukturen beschränkten Grades, für welche die nicht-elementaren unteren Schranken nicht gelten. Für diese Einschränkung werden Algorithmen mit elementarer Laufzeit für die Konstruktion von Gaifman-Normalformen, Feferman-Vaught-Zerlegungen, und für die Erhaltungssätze von Lyndon, Łoś und Tarski entwickelt, die in den ersten beiden Fällen worst-case optimal sind. Wichtig hierfür sind Hanf-Normalformen. Es wird gezeigt, dass eine Erweiterung von FO durch unäre Zählquantoren genau dann Hanf-Normalformen erlaubt, wenn alle Zählquantoren ultimativ periodisch sind, und wie Hanf-Normalformen in diesen Fällen in elementarer und worst-case optimaler Zeit konstruiert werden können. Dies führt zu Model-Checking Algorithmen für solche Erweiterungen von FO sowie zu Verallgemeinerungen der Algorithmen für Feferman-Vaught-Zerlegungen und die Erhaltungssätze von Lyndon, Łoś und Tarski.
Normal forms express semantic properties of logics by means of syntactical restrictions. They allow algorithms to benefit from restrictions of the expressive power of a logic. An example is the locality of first-order logic (FO), which implies that properties like reachability or connectivity cannot be defined in FO. Gaifman's local normal form expresses the satisfaction conditions of an FO-formula by a Boolean combination of local statements. Gaifman normal form serves as a first step in fixed-parameter model-checking algorithms, parameterised by the size of the formula, on sparse graph classes. However, it is known that in general, there are non-elementary lower bounds for the costs involved in transforming a formula into Gaifman normal form. This leads to an enormous parameter-dependency of the aforementioned algorithms. Similar non-elementary lower bounds also hold for Feferman-Vaught decompositions and for the preservation theorems by Lyndon, Łoś, and Tarski. This thesis investigates the complexity of these normal forms when restricting attention to classes of structures of bounded degree, for which the non-elementary lower bounds are known to fail. Under this restriction, the thesis provides algorithms with elementary and even worst-case optimal running time for the construction of Gaifman normal form and Feferman-Vaught decompositions. For the preservation theorems, algorithmic versions with elementary running time and non-matching lower bounds are provided. Crucial for these results is the notion of Hanf normal form. It is shown that an extension of FO by unary counting quantifiers allows Hanf normal forms if, and only if, all quantifiers are ultimately periodic, and furthermore, how Hanf normal form can be computed in elementary and worst-case optimal time in these cases. This leads to model-checking algorithms for such extensions of FO and also allows generalisations of the constructions for Feferman-Vaught decompositions and preservation theorems.

48

Huygens, David. "Design of survivable networks with bounded-length paths." Doctoral thesis, Universite Libre de Bruxelles, 2005. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/211008.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

In this thesis, we consider the k-edge connected L-hop-constrained network design problem. Given a weighted graph G=(N,E), a set D of pairs of terminal nodes, and two integers k,L > 1, it consists in finding in G the minimum cost subgraph containing at least k edge-disjoint paths of at most L edges between each pair in D. This problem is of great interest in today's telecommunication industry, where highly survivable networks need to be constructed.

We first study the particular case where the set of demands D is reduced to a single pair {s,t}. We propose an integer programming formulation for the problem, which consists in the st-cut and trivial inequalities, along with the so-called L-st-path-cut inequalities. We show that these three classes of inequalities completely describe the associated polytope when k=2 and L=2 or 3, and give necessary and sufficient conditions for them to be facet-defining. We also consider the dominant of the associated polytope, and discuss how the previous inequalities can be separated in polynomial time.

We then extend the complete and minimal description obtained above to any number k of required edge-disjoint L-st-paths, but when L=2 only. We devise a cutting plane algorithm to solve the problem, using the previous polynomial separations, and present some computational results.

After that, we consider the case where there is more than one demand in D. We first show that the problem is strongly NP-hard, for all L fixed, even when all the demands in D have one root node in common. For k=2 and L=2,3, we give an integer programming formulation, based on the previous constraints written for all pairs {s,t} in D. We then proceed by giving several new classes of facet-defining inequalities, valid for the problem in general, but more adapted to the rooted case. We propose separation procedures for these inequalities, which are embedded within a Branch-and-Cut algorithm to solve the problem when L=2,3. Extensive computational results from it are given and analyzed for both random and real instances.

Since those results appear less satisfactory in the case of arbitrary demands (non necessarily rooted), we present additional families of valid inequalites in that situation. Again, separation procedures are devised for them, and added to our previous Branch-and-Cut algorithm, in order to see the practical improvement granted by them.

Finally, we study the problem for greater values of L. In particular, when L=4, we propose new families of constraints for the problem of finding a subgraph that contains at least two L-st-paths either node-disjoint, or edge-disjoint. Using these, we obtain an integer programming formulation in the space of the design variables for each case.

------------------------------------------------

Dans cette thèse, nous considérons le problème de conception de réseau k-arete connexe à chemins L-bornés. Etant donné un graphe pondéré G=(N,E), un ensemble D de paires de noeuds terminaux, et deux entiers k,L > 1, ce problème consiste à trouver, dans G, un sous-graphe de cout minimum tel que, entre chaque paire dans D, il existe au moins k chemins arete-disjoints de longueur au plus L. Ce problème est d'un grand intéret dans l'industrie des télécommunications, où des réseaux hautement fiables doivent etre construits.

Nous étudions tout d'abord le cas particulier où l'ensemble des demandes D est réduit à une seule paire de noeuds. Nous proposons une formulation du problème sous forme de programme linéaire en nombres entiers, laquelle consiste en les inégalités triviales et de coupe, ainsi que les inégalités dites de L-chemin-coupe. Nous montrons que ces trois types d'inégalités décrivent complètement le polytope associé lorsque k=2 et L=2,3, et donnons des conditions nécessaires et suffisantes pour que celles-ci en définissent des facettes. Nous considérons également le dominant du polytope associé et discutons de la séparation polynomiale des trois classes précédentes.

Nous étendons alors cette description complète et minimale à tout nombre k de chemins arete-disjoints de longueur au plus 2. De plus, nous proposons un algorithme de plans coupants utilisant les précédentes séparations polynomiales, et en présentons quelques résultats calculatoires, pour tout k>1 et L=2,3.

Nous considérons ensuite le cas où plusieurs demandes se trouvent dans D. Nous montrons d'abord que le problème est fortement NP-dur, pour tout L fixé et ce, meme si les demandes sont toutes enracinées en un noeud. Pour k=2 et L=2,3, nous donnons une formulation du problème sous forme de programme linéaire en nombres entiers. Nous proposons également de nouvelles classes d'inégalités valides, pour lesquelles nous réalisons une étude faciale. Celles-ci sont alors séparées dans le cadre d'un algorithme de coupes et branchements pour résoudre des instances aléatoires et réelles du problème.

Enfin, nous étudions le problème pour de plus grandes valeurs de L. En particulier, lorsque L=4, nous donnons de nouvelles familles de contraintes pour le problème consistant à déterminer un sous-graphe contenant entre deux noeuds fixés au moins deux chemins de longueur au plus 4, que ceux-ci doivent etre arete-disjoints ou noeud-disjoints. Grace à ces dernières, nous parvenons à donner une formulation naturelle du problème dans chacun de ces deux cas.

Doctorat en sciences, Spécialisation Informatique
info:eu-repo/semantics/nonPublished

49

Kaye-Blake, William. "Demand for genetically modified food : theory and empirical findings." Lincoln University, 2006. http://hdl.handle.net/10182/19.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

As economies develop, novel products are created and markets for these products arise. Genetically modified food (GMF) is an example of such a novel product and provides economists with the opportunity to investigate an infant market. Of particular interest with GMF is the impact of consumer reactions on the market. The response of consumers to GMF and their willingness to pay for it has emerged as an important factor in the development of this technology. This research investigates these consumer responses. Prior research suggests that two aspects of consumer behaviour may be relevant for the GMF market. First, consumers may react differently to different types of GMF, so that some products are potentially more economically viable. Secondly, some consumers appear to prefer not having GMF at all. Consumer behaviour is often framed according to neoclassical economic theory. Consumer preferences over goods and the attributes of those goods are generally held to have certain properties. The aspects of consumers' reactions to GMF noted above, however, may be in conflict with two properties of preferences in neoclassical theory. First, preferences over food attributes are not separable, but may interact with each other. Secondly, some consumers may have preferences regarding GMF that are not continuous. As a result, aggregate impacts of introducing GMF may be difficult to measure, which raises a third issue for investigation, aggregation. Finally, an alternative model of consumer behaviour is bounded rationality, which theorises that choices may be discontinuous as a result of specific protocols. It also suggests that consumers seek to make good-enough choices, rather than attempting to maximise their satisfaction. Thus, optimisation or maximisation is the fourth issue considered in this thesis. In order to investigate these properties of consumers' preferences, a choice experiment survey was developed. The strength of a choice experiment for examining these issues is its focus on the impact of each product attribute on a respondent's choices. Thus, it may be possible to identify potentially discontinuous choice patterns and to identify choices affected by interactions between GM technology and other food attributes. Results from a neoclassical analysis of the survey data suggest that some consumers consider the type of benefit created with GM technology in making their choices. In addition, one-quarter to one-half of respondents may have had discontinuous preferences with respect to GMF. Reactions to GMF appear related to respondents' attitudes, but not to socio-economic or demographic descriptors. As a result, aggregate measures of the impact of GMF may not fully account for consumers' responses. A boundedly rational model also has reasonable goodness of fit, and may provide a different perspective on consumer behaviour. It is hoped that the results of this research provide a better understanding of consumer behaviour regarding GMF and, by extension, of the process of consumer adoption of novel products. It is further hoped that this attempt to incorporate choice protocols into discrete choice analysis will provide a useful example for further research.

50

Tewodrose, David. "Some functional inequalities and spectral properties of metric measure spaces with curvature bounded below." Thesis, Paris Sciences et Lettres (ComUE), 2018. http://www.theses.fr/2018PSLEE076.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

L’objectif de la thèse est de présenter de nouveaux résultats d’analyse sur les espaces métriques mesurés. Nous étendons d’abord à une certaine classe d’espaces avec doublement et Poincaré des inégalités de Sobolev pondérées introduites par V. Minerbe en 2009 dans le cadre des variétés riemanniennes à courbure de Ricci positives. Dans le contexte des espaces RCD(0,N), nous en déduisons une inégalité de Nash pondérée et un contrôle uniforme du noyau de la chaleur pondéré associé. Puis nous démontrons la loi de Weyl sur les espaces RCD(K,N) compactes à l’aide d’un théorème de convergence ponctuelle des noyaux de la chaleur associés à une suite mGH-convergente d’espaces RCD(K,N). Enfin nous abordons dans le contexte RCD(K,N) un théorème de Bérard, Besson et Gallot fournissant, à l’aide du noyau de la chaleur, une famille de plongements asymptotiquement isométriques d’une variété riemannienne fermée dans l’espace de ses fonctions de carré intégrable. Nous introduisons notamment les notions de métrique RCD, de métrique pull-back, et de convergence faible/forte de métriques RCD sur un espace RCD(K,N) compacte, et nous prouvons un résultat de convergence analogue à celui de Bérard, Besson et Gallot
The aim of this thesis is to present new results in the analysis of metric measure spaces. We first extend to a certain class of spaces with doubling and Poincaré some weighted Sobolev inequalities introduced by V. Minerbe in 2009 in the context of Riemannian manifolds with non-negative Ricci curvature. In the context of RCD(0,N) spaces, we deduce a weighted Nash inequality and a uniform control of the associated weighted heat kernel. Then we prove Weyl’s law for compact RCD(K,N) spaces thanks to a pointwise convergence theorem for the heat kernels associated with a mGH-convergent sequence of RCD(K,N) spaces. Finally we address in the RCD(K,N) context a theorem from Bérard, Besson and Gallot which provides, by means of the heat kernel, an asymptotically isometric family of embeddings for a closed Riemannian manifold into its space of square integrable functions. We notably introduce the notions of RCD metrics, pull-back metrics, weak/strong convergence of RCD metrics, and we prove a convergence theorem analog to the one of Bérard, Besson and Gallot

Дисертації з теми "Bounded theory"

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями