Spelling suggestions: "subject:"imperfectinformation"" "subject:"perfektinformation""
11 |
Market transparencyNilsson, Arvid January 2001 (has links)
The starting point in industrial organization is the notion of perfect competition. In a market with perfect competition, everything is transparent. In particular, there is perfect information about price, product value and firms' actions. This dissertation deals with exceptions from the world of perfect competition. The first two essays deal with imperfect information about prices and firms' actions, whereas the third essay considers imperfect information about the value of the traded goods. The first essay "Transparency and Competition" asks the question If prices are more or less transparent, does that favour consumers or producers? Starting from a search model, where some consumers know prices and other have to search, it is shown that a greater price transparency, i.e. a lower search cost, reduces the price in a single play of the game. When the game is repeated, however, the lower is the search cost, the easier it is to sustain collusion. Thus, promoting greater price transparency reduces the price in the stage game at the risk of increased opportunity for collusion. The second essay "Does Advertising Prevent Collusion?" analyses the case when firms can transmit price information to consumers by advertising. In contrast to the first essay, improved price transparency through advertising always reduces the price. It is even shown that the mere possibility of advertising can reduce the price, when firms are colluding. Thus, it is important to distinguish between advertising by firms and price publication by a third party. The first fosters competition, whereas thesecond may be harmful. In the third essay "Underwriter Competition" it is not the price that is more or less transparent. Instead, we consider a situation where sellers cannot transfer knowledge about their product values to the buyers. In order to overcome this problem, sellers may hire a renowned third party, an underwriter, who can certify that the products are of a certain value. The question that is posed in this essay is What happens if sellers can chose between different underwriters? It is shown that the underwriter market is a natural monopoly, where the underwriter with the highest ability toassess the value of the products gets the whole market. / Diss. Stockholm : Handelshögskolan, 2001
|
12 |
Essays on Formal and Informal Long-Term Health Insurance MarketsWoldemichael, Andinet D. 13 August 2013 (has links)
This dissertation consists of two essays examining formal and informal long term health insurance markets. The first essay analyzes heterogeneity of Long-Term Care Insurance policyholders in their lapse decision, and how their ex-ante and ex-post subjective beliefs about the probability of needing Long-Term Care affect their lapse decisions. In this essay, I develop a model of lapse decision in a two-period insurance framework with a Bayesian learning process and implement several empirical specifications of the model using longitudinal data from the Health and Retirement Study. The results show that policyholders' ex- ante point predictions of their probabilities and their uncertainties about them have a persistent but declining impact on lapse decisions. Those who believe that their risk is higher are indeed more likely to remain insured. However, as their uncertainties surrounding their ex-ante point predictions increase, their chances of lapsing increase regardless of their initial perception biases. These results are heterogeneous across cohorts and policyholders and, in particular, show that those in the older group near the average age of Nursing Home entry have a precise prediction of their risk levels compared to the younger cohort. Policy simulations show that a more informed initial purchase decision reduces the chance of lapsing down the road.
The second essay examines the extent to which informal risk sharing arrangement provides insurance against health shocks. I develop a comprehensive model of informal risk sharing contract with two-sided limited commitment which extends the standard model to a regime with the following features. Information regarding the nature of realized health shocks is imperfect and individuals' health capital stock serves as a storage technology and is a factor of production. The theoretical results show that, in such a regime, Pareto optimal allocations are history dependent even if participation constraints do not bind. I perform numerical analysis to show that risk sharing against health shock is less likely to be sustainable among non-altruistic individuals with different levels of biological survival rates and health capital productivity. The results also show that optimal allocations vary depending on the set of information available to individuals. Using panel data of households from villages in rural Ethiopia, I test the main predictions of the theoretical model. While there is negative history dependence in transfers among non-altruistic partners, history dependence is positive when risk sharing is along bloodline and kinship. However, neither short-term nor long-term health shocks are insured through informal risk sharing arrangements among non-altruistic individuals.
|
13 |
Inattention in individual expectationsCordeiro, Yara de Almeida Campos 04 1900 (has links)
Submitted by Yara de Almeida Campos Cordeiro (yarinha.a@gmail.com) on 2015-06-03T18:26:36Z
No. of bitstreams: 1
Diss_Biblioteca.pdf: 649363 bytes, checksum: 3edcafbc40c828ea9dfa7b5ecbf4892b (MD5) / Approved for entry into archive by BRUNA BARROS (bruna.barros@fgv.br) on 2015-06-12T14:12:17Z (GMT) No. of bitstreams: 1
Diss_Biblioteca.pdf: 649363 bytes, checksum: 3edcafbc40c828ea9dfa7b5ecbf4892b (MD5) / Approved for entry into archive by Marcia Bacha (marcia.bacha@fgv.br) on 2015-06-12T18:08:06Z (GMT) No. of bitstreams: 1
Diss_Biblioteca.pdf: 649363 bytes, checksum: 3edcafbc40c828ea9dfa7b5ecbf4892b (MD5) / Made available in DSpace on 2015-06-12T18:08:24Z (GMT). No. of bitstreams: 1
Diss_Biblioteca.pdf: 649363 bytes, checksum: 3edcafbc40c828ea9dfa7b5ecbf4892b (MD5)
Previous issue date: 2015-04 / This paper investigates the expectations formation process of economic agents about inflation rate. Using the Market Expectations System of Central Bank of Brazil, we perceive that agents do not update their forecasts every period and that even agents who update disagree in their predictions. We then focus on the two most popular types of inattention models that have been discussed in the recent literature: sticky-information and noisy-information models. Estimating a hybrid model we find that, although formally fitting the Brazilian data, it happens at the cost of a much higher degree of information rigidity than observed.
|
14 |
A compreensibilidade das informações contábeis e sua relação com os custos de transação sob a óptica dos profissionais de investimento / Understandability of financial information and its relationship with the transaction costs under the approach of investment professionalsRoberto Bomgiovani Cazzari 14 January 2013 (has links)
Essa dissertação foi desenvolvida com o objetivo de responder ao seguinte problema de pesquisa: há indícios de que notas explicativas das demonstrações financeiras que sejam menos compreensíveis, na visão de profissionais de investimento, conduzem a custos de transação maiores no estabelecimento de contratos? Por custos de transação, entendem-se aqueles referentes à coleta de informações, os custos de negociação e os de estabelecimento de contratos (COASE, 1991). Uma informação de difícil compreensibilidade, portanto, seria um catalisador de novos custos de transação, trazendo ineficiências no estabelecimento de contratos futuros. Para atingir os objetivos desejados, foram distribuídos questionários aos profissionais de investimento no 22º Congresso APIMEC que foi realizado nos dias 30 a 31 de agosto de 2012. Do total de participantes, 54 pessoas responderam o mesmo. De modo geral, verificou-se que sob a situação de tempo escasso e um grande custo de decodificação das notas explicativas, o que aumenta os custos de transação, pode-se conjecturar que algumas análises estejam sendo feitas de modo ineficiente, o que poderia conduzir a ineficiências no estabelecimento de contratos futuros. Verificou-se também que há indícios de que há excesso de informações e não falta das mesmas, o que conduziria a problemas de informação imperfeita e não de informação incompleta (LOPES, 2008). / This dissertation was developed in order to answer the following research problem: Is there evidence that the explanatory notes in the financial statements that are less understandable, by the investment professionals point of view, lead to higher transaction costs in establishing contracts? For transaction costs, we understood those that are related to information collection, the costs of negotiating and establishing contracts (COASE, 1991). A difficult understandability of information would therefore be a catalyst of new transaction costs, bringing inefficiencies in establishing future contracts. To achieve the desired goals, questionnaires were distributed to investment professionals in 22º Congresso Apimec that was held on 30 to 31 August 2012. Of all participants, 54 people responded it. In general, it was found that under the situation of limited time and a large cost to decode the notes, which increases transaction costs, it can be conjectured that some analyzes are being done inefficiently, which might lead inefficiencies in the establishment of futures contracts. It was also found that there is evidence that there is too much information and not lack of them, which would lead to problems of imperfect information and not incomplete information (LOPES, 2008).
|
15 |
Signální hry a jejich aplikace / Signaling games and their applicationsUhlířová, Jarmila January 2008 (has links)
Signaling games are part of games with imperfect information. The games with imperfect information mean that the player doesn't know all moves of players, which played before him. The signaling game as such are interesting because some players have more information than the others. The better informed group of players can indicate to uninformed players what they know and wait how the opponents react. Generally the move which uninformed party takes influence all players. In my papers I want to describe main rules for signaling games, show possible ways how to solve this kinds of problems and use this new knowledge in aplication on problem which can be usable in practices.
|
16 |
Bayesian opponent modeling in adversarial game environments.Baker, Roderick J.S. January 2010 (has links)
This thesis investigates the use of Bayesian analysis upon an opponent¿s behaviour in order to determine the desired goals or strategy used by a given adversary. A terrain analysis approach utilising the A* algorithm is investigated, where a probability distribution between discrete behaviours of an opponent relative to a set of possible goals is generated. The Bayesian analysis of agent behaviour accurately determines the intended goal of an opponent agent, even when the opponent¿s actions are altered randomly. The environment of Poker is introduced and abstracted for ease of analysis. Bayes¿ theorem is used to generate an effective opponent model, categorizing behaviour according to its similarity with known styles of opponent. The accuracy of Bayes¿ rule yields a notable improvement in the performance of an agent once an opponent¿s style is understood. A hybrid of the Bayesian style predictor and a neuroevolutionary approach is shown to lead to effective dynamic play, in comparison to agents that do not use an opponent model. The use of recurrence in evolved networks is also shown to improve the performance and generalizability of an agent in a multiplayer environment. These strategies are then employed in the full-scale environment of Texas Hold¿em, where a betting round-based approach proves useful in determining and counteracting an opponent¿s play. It is shown that the use of opponent models, with the adaptive benefits of neuroevolution aid the performance of an agent, even when the behaviour of an opponent does not necessarily fit within the strict definitions of opponent ¿style¿. / Engineering and Physical Sciences Research Council (EPSRC)
|
17 |
Strategy Synthesis for Multi-agent Games of Imperfect Information With Partially Given StrategiesAllen, Oden, Skog, Erik January 2022 (has links)
Finding strategies for games have been of interest tohumans throughout history. With the advancement of technologyand the way the financial market is compounded, enormous timeand resources are spent on modelling real world problems asgames and searching for strategies modelled to enhance produc-tivity and rule out inefficiencies. This thesis aims to investigate the existence of strategies that would allow players (agents)to complete common objectives when one category of agentsalready have a given strategy. This is done through studyingan example and investigating the application and implicationof the introduction of an abstraction function. The performedstudy concluded that if such a function could be more rigorouslymathematically formulated, it could increase the effectiveness ofstrategy searches and synthesis in the field. / Människor har alltid varit intresserade avatt hitta strategier för spel. I och med teknikens utveckling ochfinansmarknadens uppbyggnad läggs enorm tid och resurser påatt modellera verkliga problem som spel och söka efter strategierför att öka produktiviteten och minska ineffektivitet. Syftet medrapporten är att undersöka om det finns strategier som gör detmöjligt för spelarna (agenterna) att uppnå gemensamma mål nären kategori av agenter redan har en given strategi. Detta görsgenom att studera ett exempel och undersöka tillämpningar ochkonsekvenserna av att införa en abstraktionsfunktion. I studiendrogs slutsatsen att om en sådan funktion kunde formulerasstrikt matematiskt skulle den kunna öka effektiviteten i strate-gisökningar inom området. / Kandidatexjobb i elektroteknik 2022, KTH, Stockholm
|
18 |
Hraní her a Deepstack / General Game Playing and DeepstackSchlindenbuch, Hynek January 2019 (has links)
General game playing is an area of artificial intelligence which focuses on creating agents capable of playing many games from some class. The agents receive the rules just before the match and therefore cannot be specialized for each game. Deepstack is the first artificial intelligence to beat professional human players in heads-up no-limit Texas hold'em poker. While it is specialized for poker, at its core is a general algorithm for playing two-player zero-sum games with imperfect information - continual resolving. In this thesis we introduce a general version of continual resolving and compare its performance against Online Outcome Sampling Monte Carlo Counterfactual Regret Minimization in several games.
|
19 |
[pt] BUSCA DO CONSUMIDOR NO VAREJO DE GASOLINA BRASILEIRO / [en] CONSUMER SEARCH IN BRAZILIAN GASOLINE RETAILBARBARA FERNANDES INTROPIDI 03 May 2022 (has links)
[pt] Este trabalho procura entender padrões de busca do consumidor e se fricções informacionais desempenham um papel na dispersão de preços no varejo
brasileiro de gasolina. Na nossa abordagem, os consumidores devem se engajar
em busca custosa para obter informação sobre os preços cobrados pelos postos de gasolina. Empiricamente, dividimos nossa análise em duas partes. Na
primeira, utilizamos um modelo estrutural que nos permite estimar pontos da
distribuição dos custos de busca. Estimamos o modelo usando dados de preços
no nível do posto para vários mercados no Brasil. Na segunda parte, em duas
análises independentes, investigamos os determinantes da proporção de consumidores com baixa quantidade de busca por OLS e construímos uma estimativa
para o custo médio de busca por mercado encaixando nossas estimativas pontuais em uma distribuição paramétrica por NLS. Nossas descobertas revelam
uma variação significativa na busca do consumidor entre os mercados. Além
disso, nossos resultados revelam que a maioria dos consumidores não compara
muitos preços antes de comprar gasolina. Ademais, nossas estimativas indicam
que o número de postos de gasolina em um mercado, a distância média entre os
postos, a renda e a população são fatores importantes para explicar a proporção de consumidores que procuram em apenas um posto antes de comprar. Por
fim, o custo médio estimado de busca representa 3 por cento dos preços da gasolina,
proporção esta não desprezível. Portanto, os resultados indicam que os atritos
de informação são importantes para explicar a dispersão de preços no varejo
brasileiro de gasolina. / [en] This paper seeks to understand consumer search patterns and whether
information frictions play a role in price dispersion in Brazilian gasoline retail.
In our setting, consumers must engage in costly search to gain information
about the prices charged by gas stations. Empirically, we divide our analysis
into two parts. In the first part, we use a structural model that permits us to
estimate points of the distribution of search costs. We estimate the model using
price data at the station level for multiple markets in Brazil. In the second part,
in two independent analyzes, we investigate the determinants of the proportion
of consumers with a low amount of search by OLS and construct an estimate
for the average search cost per market by fitting our point estimates into a
parametric distribution by NLS. Our findings reveal significant variation in
consumer search across markets. Furthermore, our results reveal that most
consumers do not compare many prices before buying gasoline. Moreover, our
estimates indicate that the number of gas stations in a market, the average
distance between gas stations, income, and population are important drivers of
the proportion of consumers that search in only one gas station before buying.
Finally, the estimated average search cost represents 3 percent of gasoline prices,
a non-negligible proportion. Therefore, the results indicate that information
frictions are important to explain price dispersion in Brazilian gasoline retail.
|
20 |
Simplifying multi-agent games with imperfect information against nature using predetermined strategies : Reducing the complexity of strategy synthesis for games by treating things in our control as if they were out of our control / Förenklande av spel på grafer med hjälp av förutbestämda strategier : Förenkla skapandet av strategier för spel genom att hantera saker under kontroll som om de vore ur kontrollMalmström, Oskar January 2023 (has links)
We study games on graphs, where a coalition of agents work against an adversarial nature to achieve an objective. The agents have to collaborate while making their moves simultaneously, while receiving differing information about the state of the game and without a means of agent-to-agent communication. Before the game starts the coalition agrees on a strategy profile, where each agent is provided with a strategy which it acts in accordance to. The challenge of finding a winning strategy profile, wherein the coalition achieves their objective regardless of any influence from the adversarial nature, is called the strategy synthesis problem. For games with coalitions consisting of more than one agent, the general case of the synthesis problem is undecidable. We formalize an abstraction construction of a game where a subset of agents with predetermined strategies are abstracted into the adversarial nature of another game, for the purpose of reducing the size of the coalition of agents and in turn reduce the complexity of the strategy synthesis problem. We then prove that any winning strategy profile in the new game with fewer agents is also winning in the original game when combined with the predetermined strategies. The most interesting case is reducing a game with a coalition of two agents into a game with a single agent, since the strategy synthesis problem is decidable for games with a single agent. This allows us to test the predetermined strategy of the abstracted agent to see if it is possible to create a winning strategy profile using it. If it is not possible then we can try a different strategy. This enables an iterative approach for solving the strategy synthesis problem instead of a deductive one. / I rapporten studeras spel på grafer där ett lag av agenter samarbetar mot en fientlig omvärld för att uppnå ett mål. Agenterna måste samarbeta och göra sina drag på samma gång trots att de inte kan kommunicera med varandra och att de har olika perspektiv på lagets situation. För att lyckas med detta kommer laget överens om en gemensam strategi som består av en specifik strategi för varje individuell agent. Utmaningen att hitta en vinnande gemensam strategi för laget kallas strategisyntesproblemet och är oavgörbart i det allmänna fallet, det finns bevisat ingen algoritm som löser problemet. Vi formaliserar en abstraktionskonstruktion som tar ett spel där en delmängd av agenterna har blivit tilldelade en strategi för att sedan abstrahera de agenterna in i omvärlden i ett annat spel. Tanken är att i-och-med att agenterna redan har strategier vet vi hur de kommer agera och därmed kan vi se dem som en förutsägbar variabel i det nya spelet vi konstruerar. I det nya spelet har vi då färre agenter att skapa strategier för vilket minskar komplexiteten av strategisyntesproblemet. Vi bevisar också att en vinnande gemensam strategi i det nya spelet kan användas tillsammans med de förbestämda strategierna för att vinna det originella spelet. Det mest intressanta fallet för rapporten är om det originella spelet har två agenter i laget, då det finns algoritmer för att lösa strategisyntesproblemet för ensamma agenter. När en agent abstraheras bort och ett spel med en agent kvarstår betyder det att dessa algoritmer kan appliceras. Om en vinnande strategi hittas har problemet lösts, om inte kan man utesluta de förbestämda strategin som den abstraherade agenten använde. Det möjliggör en iterativ testning och uteslutning av strategier som inte funnits tidigare.
|
Page generated in 0.0957 seconds