Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Generous and greedy strategies
Responsible organisation
1999 (English)In: Complexity International, ISSN 1320-0682, Vol. 6Article in journal (Refereed) Published
Abstract [en]

We introduce generous, even-matched, and greedy strategies ÊÊas concepts for analyzing games. A two person prisoner's dilemma Êgame is described by the four outcomes (C,D), (C,C), (D,C), and (D,D). In a generous strategy the proportion of (C,D) is larger than that of (D,C), i.e. the probability of facing a defecting agent is larger than the probability of defecting. An even-matched strategy has the (C,D) proportion approximately equal to that of (D,C). A greedy strategy is an inverted generous strategy. The basis of the partition is that it is a zero-sum game given that the sum of the proportions of strategies (C,D) must equal that of (D,C). In a population simulation, we compare the prisoner's dilemma (PD) game with the chicken game Ê(CG), given complete as well as partial knowledge of the rules for moves in the other strategies. In a traffic intersection example, we expected a co-operating generous strategy to be successful when the cost for collision was high in addition to the presence of uncertainty. The simulation indeed showed that a generous strategy was successful in the CG part, in which agents faced uncertainty about the outcome. If the resulting zero-sum game is changed from a PD game to a CG, or if the noise level is increased, it will favor generous strategies rather than an even-matched or greedy strategies.

Place, publisher, year, edition, pages
1999. Vol. 6
National Category
Computer Science
Identifiers
URN: urn:nbn:se:bth-9257Local ID: oai:bth.se:forskinfo226A3840D7CD45E8C12572EB0052776FOAI: oai:DiVA.org:bth-9257DiVA: diva2:837036
Available from: 2012-09-18 Created: 2007-05-30 Last updated: 2015-06-30Bibliographically approved

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Carlsson, Bengt
In the same journal
Complexity International
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

Total: 29 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf