125 resultados para applied games
Resumo:
This paper examines simple parimutuel betting games under asymmetric information, with particular attention to differences between markets in which bets are submitted simultaneously versus sequentially. In the simultaneous parimutuel betting market, all (symmetric and asymmetric) Bayesian-Nash equilibria are generically characterized as a function of the number of bettors and the quality of their private information. There always exists a separating equilibrium, in which all bettors follow their private signals. This equilibrium is unique if the number of bettors is sufficiently large. In the sequential framework, earlier bets have information externalities, because they may reveal private information of bettors. They also have payoff externalities, because they affect the betting odds. One effect of these externalities is that the separating equilibrium disappears if the number of betting periods is sufficiently large. (C) 2006 Elsevier B.V. All rights reserved.
Resumo:
The mapping of matrix multiplied by matrix multiplication onto both word and bit level systolic arrays has been investigated. It has been found that well defined word and bit level data flow constraints must be satisfied within such circuits. An efficient and highly regular bit level array has been generated by exploiting the basic compatibilities in data flow symmetries at each level of the problem. A description of the circuit which emerges is given and some details relating to its practical implementation are discussed.
Resumo:
This paper seeks to explore the construction of narrative space in 3D PC computer games. With reference to Stephen Heath’s theory of filmic narrative space, the paper will examine how computer games, based on the rendition of a continuous 3D, real-time interactive environment, construct a distinct mode of narrativisation. The dynamic imbrication of the manipulation of 3D objects in a virtual world and the (re)presentation of this virtual mise-en-scene constitute an interaction that affects the concept of narrative in computer games. This leads to several questions that the paper seeks to investigate: How does the construction of space in PC games contribute to the meaning-making process or the gamer’s experience of narrative? How then is this experience of narrative game-space different from that of film?
Resumo:
We consider the behaviour of a set of services in a stressed web environment where performance patterns may be difficult to predict. In stressed environments the performances of some providers may degrade while the performances of others, with elastic resources, may improve. The allocation of web-based providers to users (brokering) is modelled by a strategic non-cooperative angel-daemon game with risk profiles. A risk profile specifies a bound on the number of unreliable service providers within an environment without identifying the names of these providers. Risk profiles offer a means of analysing the behaviour of broker agents which allocate service providers to users. A Nash equilibrium is a fixed point of such a game in which no user can locally improve their choice of provider – thus, a Nash equilibrium is a viable solution to the provider/user allocation problem. Angel daemon games provide a means of reasoning about stressed environments and offer the possibility of designing brokers using risk profiles and Nash equilibria.
Resumo:
More than 200 known diseases are transmitted via foods or food products. In the United States, food-borne diseases are responsible for 76 million cases of illness, 32,500 cases of hospitalisation and 5000 cases of death yearly. The ongoing increase in worldwide trade in livestock, food, and food products in combination with increase in human mobility (business- and leisure travel, emigration etc.) will increase the risk of emergence and spreading of such pathogens. There is therefore an urgent need for development of rapid, efficient and reliable methods for detection and identification of such pathogens.
Microchipfabrication has had a major impact on electronics and is expected to have an equally pronounced effect on life sciences. By combining micro-fluidics with micromechanics, micro-optics, and microelectronics, systems can be realized to perform complete chemical or biochemical analyses. These socalled ’Lab-on-a-Chip’ will completely change the face of laboratories in the future where smaller, fully automated devices will be able to perform assays faster, more accurately, and at a lower cost than equipment of today. A general introduction of food safety and applied micro-nanotechnology in life sciences will be given. In addition, examples of DNA micro arrays, micro fabricated integrated PCR chips and total integrated lab-on-achip systems from different National and EU research projects being carried out at the Laboratory of Applied Micro- Nanotechnology (LAMINATE) group at the National Veterinary Institute (DTU-Vet) Technical University of Denmark and the BioLabchip group at the Department of Micro and Nanotechnology (DTU-Nanotech), Technical University of Denmark (DTU), Ikerlan-IK4 (Spain) and other 16 partners from different European countries will be presented.
Resumo:
Semiclassical nonlocal optics based on the hydrodynamic description of conduction electrons might be an adequate tool to study complex phenomena in the emerging field of nanoplasmonics. With the aim of confirming this idea, we obtain the local and nonlocal optical absorption spectra in a model nanoplasmonic device in which there are spatial gaps between the components at nanometric and subnanometric scales. After a comparison against time-dependent density functional calculations, we conclude that hydrodynamic nonlocal optics provides absorption spectra exhibiting qualitative agreement but not quantitative accuracy. This lack of accuracy, which is manifest even in the limit where induced electric currents are not established between the constituents of the device, is mainly due to the poor description of induced electron densities.
Resumo:
We analyze ways by which people decompose into groups in distributed systems. We are interested in systems in which an agent can increase its utility by connecting to other agents, but must also pay a cost that increases with the size of the sys- tem. The right balance is achieved by the right size group of agents. We formulate and analyze three intuitive and realistic games and show how simple changes in the protocol can dras- tically improve the price of anarchy of these games. In partic- ular, we identify two important properties for a low price of anarchy: agreement in joining the system, and the possibil- ity of appealing a rejection from a system. We show that the latter property is especially important if there are some pre- existing constraints regarding who may collaborate (or com- municate) with whom.