A game of two halves

Review of the Year, Part I: 2001: A game

Review of the Year, Part I: 2001: A game of two halves

✍ Chloë Palmer 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 218 KB

Review of the Year, Part II: 2001: A gam

Review of the Year, Part II: 2001: A game of two halves

✍ Chloë Palmer 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 209 KB

## feature Microsoft was besieged with problems in 2001. As well as having its name, if not any fault, attached to the VeriSign fake-certificates (see Part 1), it was also involved in giving some of its best customers a virus. The FunLove virus was nestling in the corporate customer Web server for

A game of two halves? Incentive incompat

A game of two halves? Incentive incompatibility, starting point bias and the bidding game contingent valuation method

✍ Paul McNamee; Laura Ternent; Adjima Gbangou; David Newlands 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 139 KB

## Abstract The bidding game (BG) method of contingent valuation is one way to increase the precision of willingness to pay (WTP) estimates relative to the single dichotomous choice approach. However, there is evidence that the method may lead to incentive incompatible responses and be associated w

A Love of Two Halves

✍ Whiteley, P. J. 📂 Fiction 📅 2019 🏛 Unbound Digital 🌐 English ⚖ 208 KB 👁 1 views

**'An uplifting Northern novel that will warm your heart and restore your faith in humanity' – S.J. Bradley** George Mowatt, an entrepreneur, is one of the wealthiest people in Britain. Karen Barnes, a single mum living in a terraced house in south Leeds, is not. When George decides that his third

A Love of Two Halves

✍ P. J. Whiteley 📂 Fiction 📅 2019 🏛 Unbound 🌐 English ⚖ 208 KB 👁 1 views

**'An uplifting Northern novel that will warm your heart and restore your faith in humanity' – S.J. Bradley** George Mowatt, an entrepreneur, is one of the wealthiest people in Britain. Karen Barnes, a single mum living in a terraced house in south Leeds, is not. When George decides that his third

Cutting a graph into two dissimilar halv

Cutting a graph into two dissimilar halves

✍ Paul Erdós; Mark Goldberg; János Pach; Joel Spencer 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 357 KB

Given a graph G and a subset S of the vertex set of G, the discrepancy of S is defined as the difference between the actual and expected numbers of the edges in the subgraph induced on S. We show that for every graph with n vertices and e edges, n < e < n ( n -1)/4, there is an n/2-element subset wi