Mi ez

Embed Size (px)

Citation preview

  • 8/2/2019 Mi ez

    1/3

    1. Mi ez?Ez a modell a fogyaszti magatartst szimullja egy mr ismert termkhez val viszonyuls

    alapjn, ezltal alkalmas arra, hogy - a piaci szegmentumok alakulst bemutatva - egy (az

    ismert termkhez hasonl), j termk pozicionlshoz segtsget adjon. A modellben

    szerepl nk s frfiak, mint fogyasztk csoportokat/piaci szegmenseket formlnak. A

    fogyasztk, illetve a szegmensek szmnak, valamint a termk-kedveltsg belltsval

    megfigyelhet, hogy milyen sszettel s szm szegmensek alakulnak.

    2. Hogyan mkdik?A fogyasztk rendelkeznek valamilyen mrtk egy adott, ismert termkre vonatkoz

    kedveltsggel (TOLERANCE), amely meghatrozza a szegmensekben elfoglalt helyket.

    Amennyiben a kedveltsg szintje az adott szegmensben magasabb, mint amennyire maguk isrzik, gy elhagyjk az adott szegmenst s msikat keresnek. A vndorls addig tart, amg a

    piacon mindenki megtallja a szmra megfelel szegmenst.

    3. Hasznlati tmutatA NUMBER csszkn lehet belltani a potencilis fogyasztk szmt, a NUM-GROUPS csszkn pedig

    a szegmensek szmt.

    A SETUP gomb alkalmas random szegmensek kpzsre. Amennyiben csak egy lpst kvnunkvizsglni, hasznljuk a GO ONCE gombot. A GO gomb megnyomsval a modell addig fut, amg

    minden fogyaszt meg nem tallja az adott termkre vonatkoz sajt kedveltsgi szintjnek

    megfelel szegmenst.

    A kpernyn megjelen szmok jelzik a szegmensek mrett. A fehr szmok a vegyes csoportokat,

    mg a szrke szmok az egynem csoportokat jellik.

    A termk kedveltsgi szintjnek belltshoz a TOLERANCE csszkt kell hasznlni. A csszkn lv

    rtkek vltoztathatk a modell futtatsa kzben.

    A NUMBER HAPPY s a SINGLE SEX GROUPS tblk mutatjk a szegmensek alakulst. A NUMBERHAPPY mutatja, hogy hny fogyaszt tallhat a szmra megfelel kedveltsgi helyen, a SINGLE SEX

    GROUPS pedig a csak frfi, vagy csak ni szegmensek szmt mutatja.

    4. Mire figyeljnk?A szimulci vgn (miutn mindenki megtallta a szmra megfelel termk-kedveltsgi szinttel

    jellemezhet szegmenst)figyeljk meg az egynem csoportok szmt, tbb-e mint indulskor?

  • 8/2/2019 Mi ez

    2/3

    Prbljuk ki

    Hatrozzunk meg egy fogyaszti szmot, amit meg kvnunk clozni. (NUMBER) lltsunk be

    szmunkra optimlis szm szegmenst (NUM-GROUP). Indtsuk el a modellt (GO ONCE) Nzzk meg

    hogyan alakult egy lps sorn a szegmentlds. Vgl futtassuk le a modellt (GO).Prbljuk

    vltoztatni a TOLERANCE csszkn a kedveltsg mrtkt. A modell lefutst kveten,az elremegadott paramterek szerinti egy kvzi egyenslyi llapot figyelhet meg.

    Tovbbfejleszts

    Add more attributes to the model. Instead of male/female, try a trait that has more than two types,

    like race or religion. (You might use NetLogo's breeds feature to implement that.)

    Allow each breed of person to have their own tolerance.

    Complicate the tolerance rules: For example, the tolerance could go up as long as there are at least

    two of one breed.

    Allow groups to subdivide, instead of finding new groups.

    Set a maximum group size, so that if there are too many people in the group, they become unhappy.

    NETLOGO FEATURES

    Most NetLogo models put the origin (0,0) in the center of the world, but here, we have placed the

    origin near the right edge of the world and most of the patches have negative X coordinates. This

    simplifies the math for situating the groups.

    Horizontal wrapping is enabled, but vertical wrapping is disabled. Thus, the world topology is a

    "vertical cylinder".

    Notice the use of the MOD primitive to space out the groups evenly. Setting up the groups in this

    manner allows for easy movement from group to group.

    RELATED MODELS

    Segregation

    CREDITS AND REFERENCES

    This model is based on the work of the pioneering economist Thomas Schelling: Schelling, T. (1978).Micro-motives and Macro-Behavior. New York: Norton.

  • 8/2/2019 Mi ez

    3/3

    See also: Resnick, M. & Wilensky, U. (1998). Diving into Complexity: Developing Probabilistic

    Decentralized Thinking through Role-Playing Activities. Journal of Learning Sciences, Vol. 7, No. 2.

    http://ccl.northwestern.edu/papers/starpeople/

    HOW TO CITE

    If you mention this model in an academic publication, we ask that you include these citations for the

    model itself and for the NetLogo software: - Wilensky, U. (1997). NetLogo Party model.

    http://ccl.northwestern.edu/netlogo/models/Party. Center for Connected Learning and Computer-

    Based Modeling, Northwestern University, Evanston, IL. - Wilensky, U. (1999). NetLogo.

    http://ccl.northwestern.edu/netlogo/. Center for Connected Learning and Computer-Based

    Modeling, Northwestern University, Evanston, IL.

    In other publications, please use: - Copyright 1997 Uri Wilensky. All rights reserved. See

    http://ccl.northwestern.edu/netlogo/models/Party for terms of use.

    COPYRIGHT NOTICE

    Copyright 1997 Uri Wilensky. All rights reserved.

    Permission to use, modify or redistribute this model is hereby granted, provided that both of the

    following requirements are followed: a) this copyright notice is included. b) this model will not be

    redistributed for profit without permission from Uri Wilensky. Contact Uri Wilensky for appropriate

    licenses for redistribution for profit.

    This model was created as part of the project: CONNECTED MATHEMATICS: MAKING SENSE OF

    COMPLEX PHENOMENA THROUGH BUILDING OBJECT-BASED PARALLEL MODELS (OBPML). The

    project gratefully acknowledges the support of the National Science Foundation (Applications of

    Advanced Technologies Program) -- grant numbers RED #9552950 and REC #9632612.

    This model was converted to NetLogo as part of the projects: PARTICIPATORY SIMULATIONS:

    NETWORK-BASED DESIGN FOR SYSTEMS LEARNING IN CLASSROOMS and/or INTEGRATED

    SIMULATION AND MODELING ENVIRONMENT. The project gratefully acknowledges the support of

    the National Science Foundation (REPP & ROLE programs) -- grant numbers REC #9814682 and REC-0126227. Converted from StarLogoT to NetLogo, 2001.