Essays on cooperation and reciprocity

This dissertation comprises three essays that use theory-based experiments to gain understanding of how cooperation and efficiency is affected by certain variables and institutions in different types of strategic interactions prevalent in our society.

Chapter 2 analyzes indefinite horizon two-person dynamic favor exchange games with private information in the laboratory. Using a novel experimental design to implement a dynamic game with a stochastic jump signal process, this study provides insights into a relation where cooperation is without immediate reciprocity. The primary finding is that favor provision under these conditions is considerably less than under the most efficient equilibrium. Also, individuals do not engage in exact score-keeping of net favors, rather, the time since the last favor was provided affects decisions to stop or restart providing favors.

Evidence from experiments in Cournot duopolies is presented in Chapter 3 where players indulge in a form of pre-play communication, termed as revision phase, before playing the one-shot game. During this revision phase individuals announce their tentative quantities, which are publicly observed, and revisions are costless. The payoffs are determined only by the quantities selected at the end under real time revision, whereas in a Poisson revision game, opportunities to revise arrive according to a synchronous Poisson process and the tentative quantity corresponding to the last revision opportunity is implemented. Contrasting results emerge. While real time revision of quantities results in choices that are more competitive than the static Cournot-Nash, significantly lower quantities are implemented in the Poisson revision games. This shows that partial cooperation can be sustained even when individuals interact only once.

Chapter 4 investigates the effect of varying the message space in a public good game with pre-play communication where player endowments are private information. We find that neither binary communication nor a larger finite numerical message space results in any efficiency gain relative to the situation without any form of communication. Payoffs and public good provision are higher only when participants are provided with a discussion period through unrestricted text chat.

Situation awareness application

This thesis describes the design and implementation of a situation awareness application. The application gathers data from sensors including accelerometers for monitoring earthquakes, carbon monoxide sensors for monitoring fires, radiation detectors, and dust sensors. The application also gathers Internet data sources including data about traffic congestion on daily commute routes, information about hazards, news relevant to the user of the application, and weather. The application sends the data to a Cloud computing service which aggregates data streams from multiple sites and detects anomalies. Information from the Cloud service is then displayed by the application on a tablet, computer monitor, or television screen. The situation awareness application enables almost all members of a community to remain aware of critical changes in their environments.

Situation wirtschaftlich wichtiger Grundfischbestände vor Norwegen, Spitzbergen und in der Barents-See

Assessments on NE-arctic stocks of cod, haddock, saith, redfish and Greenland halibut were carried out by the ICES 'Arctic Fisheries Working Group' in August 1996. Whereas stocks of cod, haddock, and saithe are presently in fairly good and stable condition the assessments show the stocks of beaked redfish and Greenland hailibut to be just the opposite. The status of the golden redfish stock seems to be stable. More detailed information is given in this report.

Über die Situation des Kabeljaubestandes in der Nordsee, unter besonderer Berücksichtigung der Deutschen Bucht

Seit der letzten speziellen Situationsbeschreibung des Kabeljaubestandes in dieser Zeitschrift sind 4 Jahre vergangen (EHRICH, 1988). In der Zwischenzeit ist besonders den Fischern durch weitere Fangeinbußen bewußt geworden, daß sich der Zustand des Bestandes nicht verbessert, sondern im Gegenteil weiter verschlechtert hat. Die Schonmaßnahmen wie stufenweise Erhöhung der vorgeschriebenen Mindestmaschenweite auf 100 mmm und eine Reduzierung des Fischereiaufwandes in den Jahren 1991 und 1992 auf 70 % des Aufwandes in 1989 (Mindesthafenliegezeit: durchgehend 8 Tage pro Monat oder alternativ Erhöhung der Mindestmaschenweite auf 110 mm für die direkte Fischerei auf Kabeljau und Schellfisch) haben keine positive Wirkung gezeigt.

Analysis and Use of Information and Communication Tools in Economics of Climate Change

16 p.

Westgrönland, der Kabeljaubestand und die hydrographische Situation im Herbst 1988

Über die positive Entwicklung des Kabeljaubestandes unter Westgrönland, ab Mitte der 80iger Jahre wurde bereits im Vorjahr berichtet. Die mit FFS "Walther Herwig" im Herbst 1987 erzielten Surveyergebnisse dokumentieren einen steilen Anstieg der Bestandsgröße sowohl hinsichtlich der Individuenzahl (Abundanz) als auch des Bestandsgewichts (Biomasse) um das 4-fache auf 583 Millionen Fische bzw. um das 6-fache auf 464000 Tonnen. Diese Bestandszunahme war zahlenmäßig zu 88% und gewichtsmäßig zu 85% auf die Rekrutierung der 3 jährigen Kabeljau des starken Nachwuchsjahrganges 1984 zurückzuführen.

Information-theoretic Studies and Capacity Bounds: Group Network Codes and Energy Harvesting Communication Systems

Network information theory and channels with memory are two important but difficult frontiers of information theory. In this two-parted dissertation, we study these two areas, each comprising one part. For the first area we study the so-called entropy vectors via finite group theory, and the network codes constructed from finite groups. In particular, we identify the smallest finite group that violates the Ingleton inequality, an inequality respected by all linear network codes, but not satisfied by all entropy vectors. Based on the analysis of this group we generalize it to several families of Ingleton-violating groups, which may be used to design good network codes. Regarding that aspect, we study the network codes constructed with finite groups, and especially show that linear network codes are embedded in the group network codes constructed with these Ingleton-violating families. Furthermore, such codes are strictly more powerful than linear network codes, as they are able to violate the Ingleton inequality while linear network codes cannot. For the second area, we study the impact of memory to the channel capacity through a novel communication system: the energy harvesting channel. Different from traditional communication systems, the transmitter of an energy harvesting channel is powered by an exogenous energy harvesting device and a finite-sized battery. As a consequence, each time the system can only transmit a symbol whose energy consumption is no more than the energy currently available. This new type of power supply introduces an unprecedented input constraint for the channel, which is random, instantaneous, and has memory. Furthermore, naturally, the energy harvesting process is observed causally at the transmitter, but no such information is provided to the receiver. Both of these features pose great challenges for the analysis of the channel capacity. In this work we use techniques from channels with side information, and finite state channels, to obtain lower and upper bounds of the energy harvesting channel. In particular, we study the stationarity and ergodicity conditions of a surrogate channel to compute and optimize the achievable rates for the original channel. In addition, for practical code design of the system we study the pairwise error probabilities of the input sequences.

International communication strategy followed by Ikea : analysis of campaigns in different countries, features and possible justifications of the differences

International communication strategy followed by Ikea analysis of campaigns in different countries, features and possible justifications of the differerences.

2.0 funtsezko tresna bezala informazioaren kudeaketan

[EU]Ezagutzaren gizartean aurkitzen gara eta informazioak enpresa munduan hartu duen garrantziak garapen berriak ekarri ditu bai ikerketan bai informazio eta komunikazio teknologietan (IKT). Beraz, enpresek informazioa era sistematiko batean kudeatu beharra dute ez badute lehiakortasuna galdu nahi. Egoera honetan, zaintza teknologikoak paper garrantzitsu bat betetzen du informazioa lortzeaz, gordetzeaz eta transmititzeaz arduratzen den sistema baita. Baina sistema honen irispena mugatuta egongo da erabiltzen diren baliabideengatik. Gainera, muga hori garrantzi handiagoa hartzen du ETEtan, Euskal Herriko ekonomia-ehunaren oinarria, non baliabideak minimoak diren eta enpresa handiagoekin lehiatu behar diren. Egoera honi aurre egiteko, 2.0 tresnak aurkezten dira, zaintza teknologikorako baliagarriak diren tresnak, kostu eta denbora minimoak eskatzen dituztenak. Horrela, lan hau Euskal Herriko ETEtan zaintza teknologikoaren egoera aztertzera eta bere beharretara egokitzen diren soluzio teknologikoak planteatzera zuzenduta joango da, 2.0 tresnak oinarri moduan daudela.

Measurement of the wavefront of a laser diode system for intersatellite communication by a Jamin double-shearing interferometer

The frame of a laser diode transmitter for intersatellite communication is concisely introduced. A simple, novel and visual method for measuring the diffraction-limited wavefront of the transmitter by a Jamin double-shearing interferometer is proposed. To verify the validity of the measurement, the far-field divergence of beam is additionally rigorously analysed in terms of the Fraunhofer diffraction. The measurement, the necessary analyses and discussion are given in detail. By directly measuring the fringe widths and quantitatively interpreting the interference fringes, the minimum detectable wavefront height (DWH) of the wavefront is only 0.2 gimel (the distance between the perfect plane wavefront and the actual wavefront at the transmitting aperture) and the corresponding divergence is only 65.84 mu rad. This indicates that the wavefront approaches the diffraction-limited condition. The results show that this interferometer is a powerful tool for testing the semiconductor laser beam's wavefront, especially the diffraction-limited wavefront.

Feedback communication using orthogonal signals

This research is concerned with block coding for a feedback communication system in which the forward and feedback channels are independently disturbed by additive white Gaussian noise and average power constrained. Two coding schemes are proposed in which the messages to be coded for transmission over the forward channel are realized as a set of orthogonal waveforms. A finite number of forward and feedback transmissions (iterations) per message is made. Information received over the feedback channel is used to modify the waveform transmitted on successive forward iterations in such a way that the expected value of forward signal energy is zero on all iterations after the first. Similarly, information is sent over the feedback channel in such a way that the expected value of feedback signal energy is also zero on all iterations after the first. These schemes are shown to achieve a lower probability of error than the best one-way coding scheme at all rates up to the forward channel capacity, provided only that the feedback channel capacity be greater than the forward channel capacity. These schemes make more efficient use of the available feedback power than existing feedback coding schemes, and therefore require less feedback power to achieve a given error performance.

Wireless optical communication-based spatial pattern

We propose a novel communication technique which utilizes a set of mutually distinguishable optical patterns instead of convergent facula to transmit information. The communication capacity is increased by exploiting the optical spatial bandwidth resources. An optimum detector for this communication is proposed based on maximum-likelihood decision. The fundamental rule of designing signal spatial pattern is formulated from analysis of the probability of error decision. Finally, we present a typical electro-optical system scheme of the proposed communication. (c) 2006 Elsevier GmbH. All rights reserved.

Distributed Control and Optimization for Communication and Power Systems

We are at the cusp of a historic transformation of both communication system and electricity system. This creates challenges as well as opportunities for the study of networked systems. Problems of these systems typically involve a huge number of end points that require intelligent coordination in a distributed manner. In this thesis, we develop models, theories, and scalable distributed optimization and control algorithms to overcome these challenges.

This thesis focuses on two specific areas: multi-path TCP (Transmission Control Protocol) and electricity distribution system operation and control. Multi-path TCP (MP-TCP) is a TCP extension that allows a single data stream to be split across multiple paths. MP-TCP has the potential to greatly improve reliability as well as efficiency of communication devices. We propose a fluid model for a large class of MP-TCP algorithms and identify design criteria that guarantee the existence, uniqueness, and stability of system equilibrium. We clarify how algorithm parameters impact TCP-friendliness, responsiveness, and window oscillation and demonstrate an inevitable tradeoff among these properties. We discuss the implications of these properties on the behavior of existing algorithms and motivate a new algorithm Balia (balanced linked adaptation) which generalizes existing algorithms and strikes a good balance among TCP-friendliness, responsiveness, and window oscillation. We have implemented Balia in the Linux kernel. We use our prototype to compare the new proposed algorithm Balia with existing MP-TCP algorithms.

Our second focus is on designing computationally efficient algorithms for electricity distribution system operation and control. First, we develop efficient algorithms for feeder reconfiguration in distribution networks. The feeder reconfiguration problem chooses the on/off status of the switches in a distribution network in order to minimize a certain cost such as power loss. It is a mixed integer nonlinear program and hence hard to solve. We propose a heuristic algorithm that is based on the recently developed convex relaxation of the optimal power flow problem. The algorithm is efficient and can successfully computes an optimal configuration on all networks that we have tested. Moreover we prove that the algorithm solves the feeder reconfiguration problem optimally under certain conditions. We also propose a more efficient algorithm and it incurs a loss in optimality of less than 3% on the test networks.

Second, we develop efficient distributed algorithms that solve the optimal power flow (OPF) problem on distribution networks. The OPF problem determines a network operating point that minimizes a certain objective such as generation cost or power loss. Traditionally OPF is solved in a centralized manner. With increasing penetration of volatile renewable energy resources in distribution systems, we need faster and distributed solutions for real-time feedback control. This is difficult because power flow equations are nonlinear and kirchhoff's law is global. We propose solutions for both balanced and unbalanced radial distribution networks. They exploit recent results that suggest solving for a globally optimal solution of OPF over a radial network through a second-order cone program (SOCP) or semi-definite program (SDP) relaxation. Our distributed algorithms are based on the alternating direction method of multiplier (ADMM), but unlike standard ADMM-based distributed OPF algorithms that require solving optimization subproblems using iterative methods, the proposed solutions exploit the problem structure that greatly reduce the computation time. Specifically, for balanced networks, our decomposition allows us to derive closed form solutions for these subproblems and it speeds up the convergence by 1000x times in simulations. For unbalanced networks, the subproblems reduce to either closed form solutions or eigenvalue problems whose size remains constant as the network scales up and computation time is reduced by 100x compared with iterative methods.

Far-field spot compression without energy loss in main lob in wireless laser communication

Far-field spot compression without energy loss in main lob is of great significance to wireless laser communication. In this letter, we propose two schemes to obtain far-field spot compression without energy loss in main lob. One scheme is based on the simulated annealing (SA) algorithm. Using SA algorithm, we design the phase profile of the diffractive phase element (DPE). Using the designed DPE, far-field spot compression without energy loss in main lob is achieved. The other scheme is based on YG algorithm. By means of YG algorithm, we appropriately designed the DPE in the emitting plane. Using the DPE, far-field spot compression without energy loss in main lob is obtained. (c) 2007 Elsevier GmbH. All rights reserved.