Alternating offer games and private rulings of the Australian Tax Office

The concept of submitting oneself to a voluntary negotiation is by no means new to big business. Formal bargaining has been quite successful over the years in providing the venue for agents to explore a more logical and mathematical approach to bargaining. However in more recent times external influences have been applied to agents who provide better deals for favored executives. This external influence has displayed itself in taxtion negotiations to the extent that tax office agents have been dismissed for irresponsible conduct. We explore this specific type of negotiation using an alternating offer bargaining game to model the particular influences, which create unfair rulings in negotiations. By the constraints of this systematic mathematical approach to negotiation, we will explore the advantages of a more formal game theoretic approach. In this presentation we will also elaborate on finding Nash Equilibrium in alternating offer games.

Da fantasia à realidade, da realidade à fantasia: aspectos culturais, históricos e mercadológicos das campanhas publicitárias de games

A pesquisa tem como objetivo geral compreender como as empresas fabricantes de consoles de videogames da última geração (Sony, Microsoft e Nintendo) utilizam a publicidade para atingir os consumidores. O corpus de análise e interpretação delimita-se em oito peças publicitárias audiovisuais e o período de análise é de 2010 a 2011. As estratégicas metodológicas utilizadas são: quanto aos dados de pesquisa, o estudo é essencialmente qualitativo; em relação aos objetivos, a pesquisa é exploratória; quanto às fontes para obtenção de dados, a pesquisa é bibliográfica e empírica, sendo a fase empírica dividida em observação não-participante, descrição dos anúncios de games e análise de conteúdo audiovisual. Após as análises, demonstrou-se que, apesar de os games estarem na vida cotidiana e serem sonho de consumo de muitas pessoas, sua divulgação ainda é restrita a um número limitado de jogadores. Observa-se que, nas campanhas analisadas como um conjunto, há uma preocupação maior com o público adulto, o que não ocorria há cinco anos, na geração anterior de consoles. Apesar disso, os consoles ainda não são enxergados com todas as suas potencialidades tecnológicas e culturais.

The exact sample complexity of PAC-learning problems with unit VC dimension

The Vapnik-Chervonenkis (VC) dimension is a combinatorial measure of a certain class of machine learning problems, which may be used to obtain upper and lower bounds on the number of training examples needed to learn to prescribed levels of accuracy. Most of the known bounds apply to the Probably Approximately Correct (PAC) framework, which is the framework within which we work in this paper. For a learning problem with some known VC dimension, much is known about the order of growth of the sample-size requirement of the problem, as a function of the PAC parameters. The exact value of sample-size requirement is however less well-known, and depends heavily on the particular learning algorithm being used. This is a major obstacle to the practical application of the VC dimension. Hence it is important to know exactly how the sample-size requirement depends on VC dimension, and with that in mind, we describe a general algorithm for learning problems having VC dimension 1. Its sample-size requirement is minimal (as a function of the PAC parameters), and turns out to be the same for all non-trivial learning problems having VC dimension 1. While the method used cannot be naively generalised to higher VC dimension, it suggests that optimal algorithm-dependent bounds may improve substantially on current upper bounds.

Exact solution of the Bragg-diffraction problem in sillenites

A method for the exact solution of the Bragg-difrraction problem for a photorefractive grating in sillenite crystals based on Pauli matrices is proposed. For the two main optical configurations explicit analytical expressions are found for the diffraction efficiency and the polarization of the scattered wave. The exact solution is applied to a detailed analysis of a number of particular cases. For the known limiting cases there is agreement with the published results.

Semantics of query-driven communication of exact values

We address the question of how to communicate among distributed processes valuessuch as real numbers, continuous functions and geometrical solids with arbitrary precision, yet efficiently. We extend the established concept of lazy communication using streams of approximants by introducing explicit queries. We formalise this approach using protocols of a query-answer nature. Such protocols enable processes to provide valid approximations with certain accuracy and focusing on certain locality as demanded by the receiving processes through queries. A lattice-theoretic denotational semantics of channel and process behaviour is developed. Thequery space is modelled as a continuous lattice in which the top element denotes the query demanding all the information, whereas other elements denote queries demanding partial and/or local information. Answers are interpreted as elements of lattices constructed over suitable domains of approximations to the exact objects. An unanswered query is treated as an error anddenoted using the top element. The major novel characteristic of our semantic model is that it reflects the dependency of answerson queries. This enables the definition and analysis of an appropriate concept of convergence rate, by assigning an effort indicator to each query and a measure of information content to eachanswer. Thus we capture not only what function a process computes, but also how a process transforms the convergence rates from its inputs to its outputs. In future work these indicatorscan be used to capture further computational complexity measures. A robust prototype implementation of our model is available.

Compositional semantics of dataflow networks with query-driven communication of exact values

We develop and study the concept of dataflow process networks as used for exampleby Kahn to suit exact computation over data types related to real numbers, such as continuous functions and geometrical solids. Furthermore, we consider communicating these exact objectsamong processes using protocols of a query-answer nature as introduced in our earlier work. This enables processes to provide valid approximations with certain accuracy and focusing on certainlocality as demanded by the receiving processes through queries. We define domain-theoretical denotational semantics of our networks in two ways: (1) directly, i. e. by viewing the whole network as a composite process and applying the process semantics introduced in our earlier work; and (2) compositionally, i. e. by a fixed-point construction similarto that used by Kahn from the denotational semantics of individual processes in the network. The direct semantics closely corresponds to the operational semantics of the network (i. e. it iscorrect) but very difficult to study for concrete networks. The compositional semantics enablescompositional analysis of concrete networks, assuming it is correct. We prove that the compositional semantics is a safe approximation of the direct semantics. Wealso provide a method that can be used in many cases to establish that the two semantics fully coincide, i. e. safety is not achieved through inactivity or meaningless answers. The results are extended to cover recursively-defined infinite networks as well as nested finitenetworks. A robust prototype implementation of our model is available.

Dynamics of Boolean networks: an exact solution

The dynamics of Boolean networks (BN) with quenched disorder and thermal noise is studied via the generating functional method. A general formulation, suitable for BN with any distribution of Boolean functions, is developed. It provides exact solutions and insight into the evolution of order parameters and properties of the stationary states, which are inaccessible via existing methodology. We identify cases where the commonly used annealed approximation is valid and others where it breaks down. Broader links between BN and general Boolean formulas are highlighted.

Olympic games, mega-events, and civil societies:globalisation, environment, resistance

This volume explores sports mega-events, their social, political, and cultural characters, the value systems that they inscribe and draw on, the claims they make on us and the claims the organisers make for them, the spatial and ethical relationships they create, and the responses of civil societies to them. Our premise is that sports mega-events are not simply sporting or cultural phenomena. They are also political and economic events, characterised by the generation and projection of symbolic meanings – most obviously over the nature of statehood, economic power, and of collective cultural identity – and by social conflict, especially over land use, and over the extent and contours of public spending commitments. Because of their peculiar spatial and temporal organization, they raise questions about the relationships between global cultural and economic flows and particular local and national spaces. Because of their evolutionary characteristics, they ask us to consider not simply the time of the event but of the effects of the event on the long-term direction, implementation, and consequences of public policy.