IDEAS home Printed from https://ideas.repec.org/a/sae/simgam/v48y2017i5p670-694.html
   My bibliography  Save this article

Recipes for Structural Fairness in Games

Author

Listed:
  • Precha Thavikulwat

Abstract

Background. Although fairness is central to society and to games that are taken seriously, the structural aspect of fairness has not been addressed as a problem of games. Aim. To resolve the problem of structural fairness in multi-player, multi-episodic games , especially for business games that are transaction based, where sales result from individual transactions rather than from formulae that aggregate and allocate modeled-market demand. Method. Mathematics and examples are used to clarify positions, present proofs, and show application. Argument. Structural fairness is of three kinds: positional, order, and arrival. Finding. For fixed number of parties, positional rotation assures complete positional fairness, whereas order rotation assures both complete positional fairness and complete order fairness, but only when number-of-party and number-of-episode conditions are satisfied. For variable number of parties, arrival rotation assures fairness to parties added last. The classic Gold and Pray model can be modified to allow supply to affect demand by applying order rotation to stock outs. Application. The rotational procedures apply to business games with modeled and real markets, and may apply to all games with a scoring system that is taken seriously. Conclusion. Games can be structurally fair, but the game that is structurally fair must be a multi-episodic game that incorporates fairness into its design. For assuring structural fairness, proportional and random methods are generally inferior to rotation.

Suggested Citation

  • Precha Thavikulwat, 2017. "Recipes for Structural Fairness in Games," Simulation & Gaming, , vol. 48(5), pages 670-694, October.
  • Handle: RePEc:sae:simgam:v:48:y:2017:i:5:p:670-694
    DOI: 10.1177/1046878117719549
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/1046878117719549
    Download Restriction: no

    File URL: https://libkey.io/10.1177/1046878117719549?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sae:simgam:v:48:y:2017:i:5:p:670-694. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: SAGE Publications (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.