Optimistic linear programming gives logarithmic regret for irreducible MDPs

We present an algorithm called Optimistic Linear Programming (OLP) for learning to optimize average reward in an irreducible but otherwise unknown Markov decision process (MDP). OLP uses its experience so far to estimate the MDP. It chooses actions by optimistically maximizing estimated future rewards over a set of next-state transition probabilities that are close to the estimates, a computation that corresponds to solving linear programs. We show that the total expected reward obtained by OLP up to time T is within C(P) log T of the reward obtained by the optimal policy, where C(P) is an explicit, MDP-dependent constant. OLP is closely related to an algorithm proposed by Burnetas and Katehakis with four key differences: OLP is simpler, it does not require knowledge of the supports of transition probabilities, the proof of the regret bound is simpler, but our regret bound is a constant factor larger than the regret of their algorithm. OLP is also similar in flavor to an algorithm recently proposed by Auer and Ortner. But OLP is simpler and its regret bound has a better dependence on the size of the MDP.

Is optimistic bias influenced by control or delay?

Optimistic bias is a commonly observed but poorly explained phenomenon. Our aim was to determine whether optimistic bias varied according to the nature of the event. Two event characteristics were explored: control and delay. A sample of 100 participants aged 18–30 years was randomly selected from the local residential telephone directory. Respondents were interviewed over the telephone. The highly structured interview schedule assessed respondents' perceptions of their own risk, and the risk of an average person of their age and sex for experiencing four negative life events: developing skin cancer, being involved in a serious car accident as the driver, being involved in a serious car accident as a passenger and having to wear a hearing aid. It also assessed respondents' perceptions of control and delay for each event. Data analysis using a repeated-measures MANOVA showed that optimistic bias occurred for all four events. Optimistic bias was significantly greater for the two events high in control (skin cancer and accident as the driver) than for those low in control (accident as a passenger and hearing aid). Delay was not related to the magnitude of optimistic bias. These findings have implications for health promotion campaigns and self-protective behaviors.

Optimistic bias for negative and positive events.

Presents results of an investigation into the occurrence of optimistic bias in relation to both positive and negative events, using absolute judgements to assess perceived risk for each of six events. Participants were asked why they offered different ratings for themselves and for others. The results showed that optimistic bias is a pervasive phenomenon that occurs for both positive and negative events. It occurred for all six events when comparisons were made with an unspecified person of the same age and sex, and occurred for three of six events when comparisons were made with the same-sex best friend. Participants could provide information about their own behaviour that they felt justified their positive outlook; however, they implicitly assumed that the comparison target did not engage in the same behaviour. Concludes that risk-reduction education needs to be made personally relevant to the target audience.

Investigation of an optimistic based concurrency control mechanism for parallel file systems

Parallel file systems offer improved performance over traditional file systems by allowing processes to access file data, stored over a number of disks, in parallel. When this file is to be accessed by many processes at the same time for reading and writing, the problem of maintaining file consistency is introduced. The general approach to maintaining file consistency is through the use locks which grant a single process exclusive access to the file. Existing studies have found parallel file systems and associated applications rarely experience conflict, resulting in unnecessary overheads from locks being acquired. This paper examines an alternate approach to maintaining file consistency, which is based on optimistic concurrency control. This approach was shown to have a much smaller overhead when compared with traditional lock-based approaches; especially in situations when there is little contention. This paper presents the design, implementation and initial testing results of an optimistic based concurrency control mechanism.

Exploring optimistic and pessimistic attributions in depression-specific mood

Cognitive theories of depression include maladaptive thinking styles as depressive vulnerabilities. The hopelessness theory of depression (Abramson, Metalsky, & Alloy, 1989) particularly implicates stable and global attributions for negative events as influences upon depression. Positive event attributions are considered less influential, yet they have shown equal predictiveness to negative event attributions for depression-specific mood. Previous research has provided equivocal results largely because of cross-sectional design and modest psychometric properties of the measures. The present research aimed to: create a new instrument to measure optimistic and pessimistic attributions; test the relatedness of attributions for positive and negative events; and, clarify relationships of the scales with optimism and mood. Three studies were undertaken, all of which used structural equation modeling. Two cross-sectional studies, using 342 and 332 community participants respectively, developed and validated the Questionnaire of Explanatory Style (QES). A final longitudinal study with 250 community participants tested the predictive validity of the QES. Overall, six scales were developed, three of which were optimistic and three of which were negative. The scales were acceptable to community samples and had adequate psychometric properties. The optimistic scales were attributions for positive events and the negative scales were attributions for negative events rather than pessimistic scales. Cross-sectional results indicated that only one of the negative scales weakly directly predicted depression-specific mood, but all predicted general psychological distress. By contrast, the optimistic scales were more directly predictive of depression-specific mood, particularly the Positive Disposition scale. Longitudinal results indicated that two of the optimistic scales were the most important QES predictors of depression-specific mood two months later. The optimistic scale Positive Disposition appears most central to the prediction of both concurrent and subsequent depression-specific mood. The scale content represents explanations for positive events that are internal and stable characteristics. These may be construed as personal competencies to bring about positive outcomes. This scale is closely allied to measures of optimism. Findings affirm the importance of optimistic attributions to the understanding of depression-specific mood and provide a productive focus for therapeutic intervention and future research.

Further observations on optimistic fair exchange protocols in the multi-user setting

Recent research has shown that the single-user security of optimistic fair exchange cannot guarantee the multi-user security. This paper investigates the conditions under which the security of optimistic fair exchange in the single-user setting is preserved in the multi-user setting. We first introduce and define a property called “Strong Resolution-Ambiguity”. Then we prove that in the certified-key model, an optimistic fair exchange protocol is secure in the multi-user setting if it is secure in the single-user setting and has the property of strong resolution-ambiguity. Finally we provide a new construction of optimistic fair exchange with strong resolution-ambiguity. The new protocol is setup-free, stand-alone and multi-user secure without random oracles.

Optimistic fair exchange with strong resolution-ambiguity

Optimistic fair exchange (OFE) allows two parties to exchange their digital items in a fair way. As one of the fundamental problems in secure electronic business and digital rights management, OFE has been studied intensively since its introduction. This paper introduces and defines a new property for OFE: Strong Resolution-Ambiguity. We show that many existing OFE protocols have the new property, but its formal investigation has been missing in those protocols. We prove that in the certified-key model, an OFE protocol is secure in the multi-user setting if it is secure in the single-user setting and has the property of strong resolution-ambiguity. Our result not only simplifies the security analysis of OFE protocols in the multi-user setting but also provides a new approach for the design of multi-user secure OFE protocols. Following this approach, a new OFE protocol with strong resolution-ambiguity is proposed. Our analysis shows that the protocol is setup-free, stand-alone and multi-user secure without random oracles.

Associations between confidence, persistence, and optimism : illuminating optimistic problem solving activity

As part of video-stimulated post-lesson student interview studies of problem solving activity, Williams (2005, 2011) found successful problem solvers were optimistic. This study interrogates data from three students from a broader study: the role of optimism in collaborative problem solving and how to build it. The research question that focuses this study is “What associations exist between confidence, persistence, and optimism?” The question is explored both theoretically and empirically for the purpose of increasing understanding of the nature of optimistic problem solving activity by linking it to more familiar constructs. Students were progressively selected to further the interrogatory process. It was found that confidence and persistence did not necessarily occur together, and when they did, activity associated with these two characteristics was not sufficient for optimistic problem solving activity to occur. Perseverance was also required.

Preserving transparency and accountability in optimistic fair exchange of digital signatures

Optimistic fair exchange (OFE) protocols are useful tools for two participants to fairly exchange items with the aid of a third party who is only involved if needed. A widely accepted requirement is that the third party's involvement in the exchange must be transparent, to protect privacy and avoid bad publicity. At the same time, a dishonest third party would compromise the fairness of the exchange and the third party thus must be responsible for its behaviors. This is achieved in OFE protocols with another property called accountability. It is unfortunate that the accountability has never been formally studied in OFE since its introduction ten years ago. In this paper, we fill these gaps by giving the first complete definition of accountability in OFE where one of the exchanged items is a digital signature and a generic (also the first) design of OFE where transparency and accountability coexist.