National Repository of Grey Literature 49 records found  beginprevious21 - 30nextend  jump to record: Search took 0.00 seconds. 
A behavioral analysis of market failures
Urbanová, Aneta ; Sieber, Martina (advisor) ; Vlček, Josef (referee)
The thesis deals with a contemporary stream of the behavioral economics at the labour market in connection with a divergence to the neoclassical theory based on explicit assumption of rationality. The existing theoretical approaches and the examples of experiments are introduced in the theoretical part. The irrational impacts on labour market is defined by the amount of wage, unemployment, education, but on the other hand also by motivation, loss aversion, prejudices and other cognitive biases in human decision making process. The practical part is based on the standardized questionnaire survey in which the respondents were given some simplified decision making dilemmas in context of the labour market. The aim of the thesis is to observe their tendency to choose not always the most effective option and to validate the impact of irrational factors on decision making according to the theoretical approaches. Key words: Behavioral economics, limited rationality, market failures, labour market, prospect theory, heuristics, biases
Demonstrations of Jumping Automata
Růžička, Ladislav ; Kocman, Radim (referee) ; Křivka, Zbyněk (advisor)
This paper is concerned with demonstration of newly investigated jumping finite automata. Unlike conventional finite automata that read input words continuously these automatas make a jump over some symbols and from there it can read a symbol. In this paper we will be mostly focused on finding a practical algorithm for solving the membership problem. As will be shown the membership problem for jumping finite automata can be reduced to finding a non-negative integral solution to a Quantifier-Free Presburger arithmetics formula. From such formula we are able to determine whole infinite language of jumping finite automata. We will show that some subset of jumping finite automata can be solved in polynomial time. We note that formula in Presburger arithmetics can be transformed to the corresponding concurent finite automata. Unfortunately for general jumping automata finding non-negative solution is not sufficent but it can reduce search space. Other heuristics will be presented that increase the effectivity for the general jumping finite automata acceptance process.
Cognitive biases: How much are we influenced by previous rating? Effect of previous rating on the following "quality" of the movie.
Michňák, Matěj ; Cingl, Lubomír (advisor) ; Máslo, Lukáš (referee)
This thesis examines whether our choice of movie rating is influenced by previous rating based on a simple web experiment. There are 2 groups - group of laymen from the ranks of students and group of active movie fans. Each participant was randomly distributed into one of 3 subgroups in his group. There is a control subgroup with no previous rating, a treatment subgroup with low previous rating and a treatment subgroup with high previous rating. In 3 out of 4 treatment subgroups there was found out using regression analysis significant change of average rating in comparison to control subgroups by more than 1 point on scale 1 to 10. There wasn´t found out smaller bias towards previous rating in group of movie fans, which was the reason why this group had been added. Subgroups with low previous rating influence average rating in both groups, subgroups with high previous rating only in group of active movie fans.
Implementation of Heuristics for Vehicle Routing Problem with Time Windows
Trunda, Otakar ; Pelikán, Jan (advisor) ; Holý, Vladimír (referee)
Vehicle Routing Problem with Time Windows is a hard optimization problem. Even though it has numerous practical applications, the question of solving it efficiently has not been satisfyingly solved yet. This thesis studies the Vehicle Routing Problem with Time Windows and presents several new algorithms for solving it. There are two heuristics presented here, as well as several more complex algorithms which use those heuristics as their components. The efficiency of presented techniques is evaluated experimentally using a set of test samples. As a part of this thesis, I have also developed a desktop application which implements presented algorithms and provides a few additional features useful for solving routing prob-lems in practice. Among others, there is a generator of pseudo-random problem instances and several visualization methods.
Possibilities of preventing the negative influence of cognitive biases on everyday decision making
Tesařová, Monica ; Stehlík, Luděk (advisor) ; Uhlář, Pavel (referee)
This bachelor thesis deals with possibilities of preventing the influence of cognitive biases on our everyday decision making, especially with the negative effect of the anchoring-and-adjustment heuristic on consumer behavior. The first chapter is concerned with human irrationality in decision making, primarily with cognitive biases. Some of the most significant types of cognitive biases that negatively affect our decision making are presented and various approaches trying to explain their origin and nature are introduced subsequently. It continues with a chapter on possibilities of the prevention of cognitive biases where the theory of debiasing is mentioned and an example of a successful debiasing strategy is presented. The last chapter of the theoretical part focuses in detail on one particular type of cognitive bias that arises from using the anchoring-and-adjustment heuristic. The aim of the empirical part of the thesis is then to propose a strategy that will, at least partially, help reducing the negative impact of this bias on our decision making in everyday situations - particularly from the consumer perspective. Another part of this is also an outline for an experimental study that would help verify the effectiveness of the proposed measures. Keywords: heuristics, cognitive biases,...
Walks in time-dymanic graph model
Beliš, Marek ; Pangrác, Ondřej (advisor) ; Hric, Jan (referee)
Orienteering with moving control points can be represented as a graph model with ranked vertices and oriented edges. The rank of vertex depends on the actual time. Searching for the most optimised walk through this graph is NP-complete problem which can be in real-time solved only with limiting conditions and using of heuristics. SMIK solver software provides implemented heuristics for searching the best walk in several ways. In the thesis we can find description of the problem and algorithms, programming documentation with description of used methods and comparation of results to the real competition. Powered by TCPDF (www.tcpdf.org)
The contribution of Daniel Kahneman to the psychology of thinking
Zelinová, Alena ; Heller, Daniel (advisor) ; Uhlář, Pavel (referee)
Bachelor thesis in the form of scoping study summarizes Daniel Kahneman contribution to the psychology of thinking. It surveys his work from the 70s of the 20th century the subjective probability, which deals with the application of heuristics and biases in the judgement of uncertain events. It continues with prospect theory which is a descriptive model of human decision making under risk, and which reveals the automatic and systematic violations of principles of rationality in decision making. After that it focuses on Kahneman's research from the 90s in the field of hedonic psychology from the perspective of a cognitive psychologist. The thesis completes with his current work popularizing the fast and slow thinking. Part of this work is a research proposal of the price of memories from holidays, aiming to verify Kahneman's concept of the difference between the experienced utility and decision utility.
Emotional and Cognitive Determinants of Decision Making
Jonáš, Juraj ; Uhlář, Pavel (advisor) ; Stehlík, Luděk (referee)
This work summs the development of the research of influence of cognitive and emotional determinants on decision making since its beginning in 1940s, when it was studied in the framework of the theory of games, through the theory of heuristics of Tversky and Kahneman, cognitive biases theory, to the Naturalistic Decision Making movement and the somatic marker hypothesis. These most significant movements are, for the purposes of this work, divided into "normative" and "postnormative". This compilational work is supplemented with a proposal of a qualitative research of intuition of psychological therapists, which is, to date, explored only in a small extent.
Walks in time-dymanic graph model
Beliš, Marek ; Pangrác, Ondřej (advisor) ; Böhm, Martin (referee)
Orienteering with moving control points can be represented as a graph model with ranked vertices and oriented edges. The rank of vertex depends on the actual time. Searching for the most optimised walk through this graph is exponentially difficult problem which can be in real-time solved only with limiting conditions and using of heuristics. SMIK solver software provides implemented heuristics for searching the best walk in several ways. In the thesis we can find description of the problem and algorithms, programming documentation with description of used methods and comparation of results to the real competition. Powered by TCPDF (www.tcpdf.org)
Walks in time-dymanic graph model
Beliš, Marek ; Pangrác, Ondřej (advisor) ; Böhm, Martin (referee)
Orienteering with moving control points can be represented as a graph model with ranked vertices and oriented edges. The rank of vertex depends on the actual time. Searching for the most optimised walk through this graph is exponentially difficult problem which can be in real-time solved only with limiting conditions and using of heuristics. SMIK solver software provides implemented heuristics for searching the best walk in several ways. In the thesis we can find description of the problem and algorithms, programming documentation with description of used methods and comparation of results to the real competition. Powered by TCPDF (www.tcpdf.org)

National Repository of Grey Literature : 49 records found   beginprevious21 - 30nextend  jump to record:
Interested in being notified about new results for this query?
Subscribe to the RSS feed.