Globals [
  t_a_match        ;; employer threshold for application --> interview
  t_i_match        ;; employer threshold for interview --> final-candidate list
  int-patches      ;; interview space
  home-patches     ;; home space
]

breed [jobs job]
breed [candidates candidate]

candidates-own [
  candidate-skills ;; candidate skills, interest, and motivation for a job
  interest
  motivation
  skills-match-pct ;; percentage of candidate skills matching required skills for jobs
  index            ;; index consisting of skills and motivation weighted more strongly on one or the other
  rejection
  defeat
  employment       ;; identity of the employer that hired the candidate
  csat             ;; candidate satisfaction
]

jobs-own [
  des              ;; desirability of the job
  reqskills        ;; required skills for the job
  hired            ;; true or false
  applicants
  esat             ;; employer satisfaction
  rejected-candidates
]

to setup
  clear-all

  resize-world -15 15 -15 15

  ;; Create the "applicants base"
  set home-patches patches with [pxcor < 0.5]
  ask home-patches [ set pcolor grey ]

  ;; Create the "interview space"
  set int-patches patches with [pxcor > 0.5]
  ask int-patches [ set pcolor blue ]

  setup-jobs
  setup-candidates

  reset-ticks

end

to setup-jobs
  create-jobs number-of-jobs
  let rank 1
  ask jobs
  [
    set color red
    set shape "circle"
    set size 0.5
    set xcor random 15
    set ycor random-ycor
    set applicants []
    set rejected-candidates []
    set des rank
    set hired false
    set rank (rank + 1)
    set des des / number-of-jobs
    set esat 0
  ]
  create-reqskills 10
end

;; creates a list of 0s and 1s indicating that job requires or not ? skill
;; example: number-of-skills = 10 ; reqskills [0 0 1 0 1 1 1 0 1 1]
to create-reqskills [number-of-skills]
  ask jobs
  [
    set reqskills []
    foreach n-values number-of-skills [?]
    [
      set reqskills lput random 2 reqskills
    ]
  ]
end

to setup-candidates
  create-candidates number-of-candidates
  ask candidates [

    set shape "person"
    set xcor -15 + random 15
    set ycor random-ycor
    set color yellow
    set csat 0
    set defeat random-float 0.5
    set employment 0
    set motivation random-float 1.0
    set interest []
    foreach n-values number-of-jobs [?]
    [
      set interest lput random-float 1.0 interest
    ]
    create-can-skills 10
  ]
end

;; creates a list of 0s and 1s indicating that candidate has or does not have x skill
;; example: number-of-skills = 10 ; candidate-skills [0 0 1 0 1 1 1 0 1 1]
to create-can-skills [number-of-skills]
  ask candidates
  [
    set candidate-skills []
    foreach n-values number-of-skills [?]
    [
      set candidate-skills lput random 2 candidate-skills
    ]
  ]
end

to-report job-preference [ candidate job ]
  let job-interest (item ([who] of job) ([interest] of candidate))
  report job-interest + ([des] of job) / number-of-jobs
end

;; candidates attend or not jobs information session
;; for 80% of candidates, interest increases after information session
;; for 20% of candidates, interest decresases after information sessions
to-report info-s-attendance [ candidate job ]
  let info-s 0
  let job-interest (item ([who] of job) ([interest] of candidate))
  if job-interest > 0.2 [
    set info-s 0.1
    set motivation motivation + 0.2
    ask candidates [
      set defeat defeat + 0.01 ]
  ]
  report info-s
end

to-report decide-job [ candidate ]
  let best-job 0
  let best-job-pref 0
  ask jobs with [ hired = false ] [
    let pref job-preference candidate self
      ifelse (best-job = 0 and not member? candidate rejected-candidates) [
        set best-job self
        set best-job-pref pref]
      [if best-job-pref < pref
        [set best-job self
          set best-job-pref pref]
      ]
    ]

  report best-job
end

to determine-index
  ask candidates [
    if (index-weight = "motivation") [
      set index ((motivation / 2)  + (skills-match-pct / 200))
    ]
    if (index-weight = "candidate-skills") [
      set index ((motivation / 4)  + (3 * skills-match-pct / 400))
    ]
  ]
end

;; skills-match is the number of skills that overlap between
;; candidate and required skills
;; sets threshold for application and interview acceptance
to-report update-skills-match [thecandidate thejob]
  let number-of-skills-required sum [ reqskills ] of thejob
  let skills-match-count 0
  let required-skills [reqskills] of thejob
  let can-skills [candidate-skills] of thecandidate

  foreach (n-values number-of-skills-required [?])
  [
    if item ? required-skills = 1 and item ? can-skills = 1
    [ set skills-match-count skills-match-count + 1 ]
  ]
  report skills-match-count / number-of-skills-required * 100
end

to compute-t_a_match
  let skills-match-list []
  set t_a_match (mean [index] of candidates) * 0.6
end

to compute-t_i_match
  set t_i_match (mean [index] of candidates) * 0.8
end


to interview [ ajob ]
  let skill-match-pct update-skills-match self ajob
  print (list skill-match-pct "  " self)
end

to go
  while [ count (jobs with [hired = false]) > 0 ] [
    ;; starts the application process
    ;; the job ID of the result of decide-job is added to ajob (variable of self)
    ask candidates with [employment = 0] [
      let ajob 0
      ifelse random-job-selection = true [
        set ajob one-of jobs with [ hired = false ]
      ] [
      set ajob decide-job self
      ]
      ask ajob [
        set applicants lput myself applicants
      ]
    ]
    ;; asks the jobs with some number of applicants > 0
    ;; to operte the rest of the hiring steps
    ask jobs with [ hired = false and length applicants > 0 ] [
      ask candidates [
        set rejection 0
        set skills-match-pct 0
      ]
      ;; 1. application process: asks candidates to update their skills match for ajob (the job they are applying to)
      foreach applicants [
        ask ? [
          set skills-match-pct update-skills-match (?) myself
        ]

        determine-index
        ; print (list skills-match-pct "  " self)
        ; set applicant-score lput skills-match-pct applicant-score
        compute-t_i_match
      ]
      ;; 2. interview process: - we are asking jobs to sort candidates according to their skills match
      ;; and create a list of all the candidates that fulfill interview
      let final-candidates []
      foreach sort-by [ [ skills-match-pct ] of ?1 > [ skills-match-pct ] of ?2 ] applicants [
        let i 0
        ask ? [ set defeat defeat + 0.01 ]
        ifelse [ skills-match-pct ] of ? > t_a_match and i < (length applicants * 0.4) [
          set final-candidates lput ? final-candidates
          ask ? [ move-to myself fd 0.5]
        ]
        [set rejected-candidates lput ? rejected-candidates
          ask ? [ set xcor -15 + random 15
            set defeat defeat + 0.01
            set csat ( csat + motivation - 1 - defeat)]
          set i (i + 1) ]

        if length final-candidates > 0 [
          let hired-candidate item 0 (sort-by [ [ index ] of ?1 > [ index ] of ?2 ] final-candidates)
          ifelse [ index ] of hired-candidate > t_i_match [
            ask self [ set hired true ]
            ask hired-candidate [
              set employment myself
              move-to myself
              set color green
              set csat ( [ des ] of myself + job-preference hired-candidate myself )
            ]
          ]
          [set rejected-candidates lput hired-candidate rejected-candidates
            ask hired-candidate [set employment 0 set xcor -15 + random 15 ]
          ]
        ]
        ;;  print (word "HIRED" self hired-candidate [ employment ] of hired-candidate)
      ]
    ]
    give-up

    tick

    if ticks = 30 [
      stop ]
    ]

    ask candidates [
      set skills-match-pct 0
    ]

  print "########################"
  ask candidates [
    print self
    print employment
  ]
end

to update-candidate-satisfaction
  ask candidates [
    let sat 0
    ifelse rejection > 0
    [ set sat motivation - rejection ]
    [ set sat motivation + (des / 5) + interest ]
    report sat
  ]
end

;; candidates abandon OCR if they are out of energy
to give-up
  ask candidates [
    if defeat > 1
    [ set employment defeat
      set color blue]
  ]
end

to update-employer-satisfaction
  ask jobs [
    let sat 0

    ifelse hired = false
    [ set esat -1 ]
    [ set esat 1 ]
    report sat
  ]
end
@#$#@#$#@
GRAPHICS-WINDOW
210
10
623
444
15
15
13.0
1
10
1
1
1
0
1
1
1
-15
15
-15
15
0
0
1
ticks
30.0

SLIDER
19
64
191
97
number-of-jobs
number-of-jobs
0
20
20
1
1
NIL
HORIZONTAL

SLIDER
12
113
199
146
number-of-candidates
number-of-candidates
0
50
25
1
1
NIL
HORIZONTAL

CHOOSER
27
166
176
211
index-weight
index-weight
"motivation" "candidate-skills"
1

PLOT
640
17
840
167
aggregate satisfaction
Time (ticks)
Satisfaction
0.0
30.0
0.0
20.0
true
false
"" ""
PENS
"candidates" 1.0 0 -16777216 true "" "plot csat"
"employers" 1.0 0 -7500403 true "" "plot esat"

BUTTON
27
17
93
50
NIL
setup
NIL
1
T
OBSERVER
NIL
NIL
NIL
NIL
1

SWITCH
8
230
202
263
random-job-selection
random-job-selection
0
1
-1000

BUTTON
111
18
174
51
NIL
go
NIL
1
T
OBSERVER
NIL
NIL
NIL
NIL
1

MONITOR
9
285
197
330
number of candidates hired
count jobs with [hired = true]
17
1
11

@#$#@#$#@
## WHAT IS IT?

On Campus Recruitment (OCR) is the service managed by Penn Career Services that enables organizations to come to campus to interview students for post-graduate jobs and summer internships. It schedules thousands of interviews per year. OCR is the primary source of employment at Penn. 30% of students are employed through the process, and the top 10 employers, which are corporate employers with predictable hiring patterns such as banks and consultancies, each employ over 20 students.

In reality, OCR begins with the information session, in which organizations present themselves and interact with potential candidates for the first time. Interested candidates then submit an application through Career Services by a certain date, and the organization screens all applications after this date. Organizations then decide which candidates to invite to an interview. Following this first interview, there are often several more rounds of interview, after which employers decide to hire or not candidates. The process lasts approximately 30 days.

This model explores the efficiency of OCR as a process of allocating candidates with set skills, motivation, and interest, to a limited amount of jobs with set requirements and desirability. The conclusions of the model depend on the measure of efficiency. In this first model efficiency is measured with net value satisfaction. The ideal model would allocate the best fit candidates to the maximum amount of jobs.

## HOW IT WORKS

Candidates compete for jobs in successive interactions with jobs that have thresholds for successful applications and interviews (t_i_match). Candidates begin in the home patches to the left and have fixed skills, motivation, energy, and interests. Jobs begin in the interview patches to the right and have fixed skill requirements and a desirability that ranges from 1 to the number of jobs recruiting.

TO DECIDE-JOB

Candidates decide from their home patches whether to attend the organization’s information sessions, resulting in an 80% chance that their interest and motivation increase, and a 20% of the contrary. Candidates then decide to apply to one job depending on certain job preferences that combine their interest, the job’s desirability, and a self-assessment of their competence for the job.

TO DETERMINE-INDEX

Candidates have an index that includes their skills and motivation. The index can be weighted more heavily on skills or motivation (because in reality, skills mostly affect the application while motivation mostly affects the interview in which candidates meet employers and can display motivation).

TO GO

Jobs screen applications then decide to invite candidates to interview. The success of an application depends on the match of skills between applicants and jobs. Jobs look at the match between skills, invite 40% of candidates with the appropriate amount of skills to interview, then rank applicants from highest to lowest skills match, and hire the one candidate with the highest skills match of the list and an index larger than the t_i_match threshold.

In the first round, candidates prefer to apply to the most desirable jobs. As these fill up however, some candidates are not hired, and some jobs are not applied to. The model runs through the code again, with candidates applying to the jobs that have not hired someone, and these jobs screening applicants that have not been hired. Candidates once hired move to the patch of their employer. Candidates that have not been hired move to the home patches and have lower energy.

The model runs until every job has hired an applicant, or until applicants no longer have the energy to repeat the recruitment process after being rejected from a certain amount of jobs that varies from candidate to candidate. As there are more applicants than jobs, some candidates are left without employment. The number of ticks represents the number of rounds of application and interview between candidates and jobs.

To evaluate efficiency we look at net value satisfaction of candidates and employers, and aggregate satisfaction, which represents a positive externality of the process to society as employment increases social welfare. The model is more efficient for the same aggregate satisfaction if more people are getting employed as a result. For example, a model that allocates 60 skilled candidates to jobs is more efficient on the societal scale than a model that allocates 30 skilled candidates to jobs.
The satisfaction of candidates is a function of their employment. If candidates are rejected, their satisfaction is their negative energy expenditure. The more effort they put into the process, i.e., if they attended the information-session, applied, and interviewed, the stronger the pain of rejection and the lower their satisfaction. If candidates are hired, their satisfaction consists of their interest in the job and the job’s desirability.
The satisfaction of employers is a function of the caliber of their candidate, i.e., his index.

## HOW TO USE IT

Set the NUMBER-OF-CANDIDATES and NUMBER-OF-JOBS sliders to decide how many students will participate in OCR and how many positions are available. Press SETUP to create the home patches and the OCR interview space.
Choose from the INDEX-WEIGHT chooser either MOTIVATION or SKILLS to decide which factor will have a higher influence in the selection process.
You can randomize candidates’ decision to apply to a job by setting the RANDOM-JOB-SELECTION switch to on.
The SATISFACTION plot shows candidate, employer, and aggregate satisfaction.
Press GO to run the recruitment process.


## THINGS TO NOTICE

Does the relative number of candidates to jobs influence the satisfaction of candidates and employers?
Many procedures are embedded in the code. This is a model for observation rather than manipulation. For instance, the code could be modified to remove information session attendance altogether, to manually change the weights of different elements making up the indexes etc.


## THINGS TO TRY

Change NUMBER-OF-JOBS while leaving the NUMBER-OF-CANDIDATES constant and observe how this affects aggregate satisfaction and candidates hired.
Switch RANDOM-JOB-SELECTION to on and observe how this affects aggregate satisfaction for the same number of candidates and jobs.
Run the model with different options in INDEX-WEIGHTS, and see how the results differ.

## EXTENDING THE MODEL
In reality, candidates apply to multiple jobs, and jobs hire multiple candidates, which makes the recruitment process more complex.

CANDIDATE VARIABLES

Most importantly, in reality candidates have far more variables than skills, motivation, and interest. According to Career Services, two most important attributes are skills and motivation, which is related to interest. Candidates also have certain socio-economic backgrounds however, which in turn determine the number of connections they have in the industry they are applying to, which weighs heavily in the application process, as candidates with connections can be immediately admitted to an interview.

In an extension of this model, we would incorporate candidate demographics, including country of origin (because certain organizations refuse to employ foreign students if they must sponsor their visa), ethnicity and gender (because organizations have diversity programs that benefit ethnic minorities, women, and non-heterosexual candidates), connections and ability to network (because a personal tie with someone in the company trumps many of these other variables - we could use LinkedIn data here).

In this model we randomize the required skills for jobs, whereas jobs usually have higher requirements than candidates have skills. Furthermore, requirements are a function of desirability, as jobs with higher desirability are more competitive and have higher requirements.

STRATEGY AND MEMORY

A more robust version of this model would have the index weights, currently in the form of a chooser, as candidate strategies, to evaluate whether there is an optimal candidate strategy.

We would also incorporate a learning component, which allows candidates that were not employed in the first round of recruitment to learn from their mistakes and perform better in the second round. Furthermore, students that have been through OCR more than once are better positioned to be hired, as are students who have prepared thoroughly for their interviews. We would create different agent sets within candidates with more or less experience and the ability to learn.

SATISFACTION AND EFFICIENCY

Satisfaction is a function in part of motivation, which can increase or decrease throughout OCR depending on individual dispositions. Candidates who have experienced rejection can have increased motivation with an “I will do better next time” outlook, thereby performing better in a subsequent round, or feel defeated with a “ I will never succeed” outlook and have decreased motivation, which will hinder their performance.

Efficiency can be calculated different ways. We currently evaluate efficiency in absolute value with net satisfaction, but there can be a comparative component by comparing satisfaction level between regular OCR and randomized OCR. There can also be a social welfare component that is different from aggregate satisfaction.

## NETLOGO FEATURES

An interesting feature is the list of skills of candidates and employers, because it is simplified to an absence or presence of skills, rather than skills themselves.

## RELATED MODELS

In terms of turtle strategy in a transactional setting between agents, other models to look at are El Farol and Minority Game, where agents are at a disadvantage if other agents have the same behavior, similar to the application process.
@#$#@#$#@
default
true
0
Polygon -7500403 true true 150 5 40 250 150 205 260 250

airplane
true
0
Polygon -7500403 true true 150 0 135 15 120 60 120 105 15 165 15 195 120 180 135 240 105 270 120 285 150 270 180 285 210 270 165 240 180 180 285 195 285 165 180 105 180 60 165 15

arrow
true
0
Polygon -7500403 true true 150 0 0 150 105 150 105 293 195 293 195 150 300 150

box
false
0
Polygon -7500403 true true 150 285 285 225 285 75 150 135
Polygon -7500403 true true 150 135 15 75 150 15 285 75
Polygon -7500403 true true 15 75 15 225 150 285 150 135
Line -16777216 false 150 285 150 135
Line -16777216 false 150 135 15 75
Line -16777216 false 150 135 285 75

bug
true
0
Circle -7500403 true true 96 182 108
Circle -7500403 true true 110 127 80
Circle -7500403 true true 110 75 80
Line -7500403 true 150 100 80 30
Line -7500403 true 150 100 220 30

butterfly
true
0
Polygon -7500403 true true 150 165 209 199 225 225 225 255 195 270 165 255 150 240
Polygon -7500403 true true 150 165 89 198 75 225 75 255 105 270 135 255 150 240
Polygon -7500403 true true 139 148 100 105 55 90 25 90 10 105 10 135 25 180 40 195 85 194 139 163
Polygon -7500403 true true 162 150 200 105 245 90 275 90 290 105 290 135 275 180 260 195 215 195 162 165
Polygon -16777216 true false 150 255 135 225 120 150 135 120 150 105 165 120 180 150 165 225
Circle -16777216 true false 135 90 30
Line -16777216 false 150 105 195 60
Line -16777216 false 150 105 105 60

car
false
0
Polygon -7500403 true true 300 180 279 164 261 144 240 135 226 132 213 106 203 84 185 63 159 50 135 50 75 60 0 150 0 165 0 225 300 225 300 180
Circle -16777216 true false 180 180 90
Circle -16777216 true false 30 180 90
Polygon -16777216 true false 162 80 132 78 134 135 209 135 194 105 189 96 180 89
Circle -7500403 true true 47 195 58
Circle -7500403 true true 195 195 58

circle
false
0
Circle -7500403 true true 0 0 300

circle 2
false
0
Circle -7500403 true true 0 0 300
Circle -16777216 true false 30 30 240

cow
false
0
Polygon -7500403 true true 200 193 197 249 179 249 177 196 166 187 140 189 93 191 78 179 72 211 49 209 48 181 37 149 25 120 25 89 45 72 103 84 179 75 198 76 252 64 272 81 293 103 285 121 255 121 242 118 224 167
Polygon -7500403 true true 73 210 86 251 62 249 48 208
Polygon -7500403 true true 25 114 16 195 9 204 23 213 25 200 39 123

cylinder
false
0
Circle -7500403 true true 0 0 300

dot
false
0
Circle -7500403 true true 90 90 120

face happy
false
0
Circle -7500403 true true 8 8 285
Circle -16777216 true false 60 75 60
Circle -16777216 true false 180 75 60
Polygon -16777216 true false 150 255 90 239 62 213 47 191 67 179 90 203 109 218 150 225 192 218 210 203 227 181 251 194 236 217 212 240

face neutral
false
0
Circle -7500403 true true 8 7 285
Circle -16777216 true false 60 75 60
Circle -16777216 true false 180 75 60
Rectangle -16777216 true false 60 195 240 225

face sad
false
0
Circle -7500403 true true 8 8 285
Circle -16777216 true false 60 75 60
Circle -16777216 true false 180 75 60
Polygon -16777216 true false 150 168 90 184 62 210 47 232 67 244 90 220 109 205 150 198 192 205 210 220 227 242 251 229 236 206 212 183

fish
false
0
Polygon -1 true false 44 131 21 87 15 86 0 120 15 150 0 180 13 214 20 212 45 166
Polygon -1 true false 135 195 119 235 95 218 76 210 46 204 60 165
Polygon -1 true false 75 45 83 77 71 103 86 114 166 78 135 60
Polygon -7500403 true true 30 136 151 77 226 81 280 119 292 146 292 160 287 170 270 195 195 210 151 212 30 166
Circle -16777216 true false 215 106 30

flag
false
0
Rectangle -7500403 true true 60 15 75 300
Polygon -7500403 true true 90 150 270 90 90 30
Line -7500403 true 75 135 90 135
Line -7500403 true 75 45 90 45

flower
false
0
Polygon -10899396 true false 135 120 165 165 180 210 180 240 150 300 165 300 195 240 195 195 165 135
Circle -7500403 true true 85 132 38
Circle -7500403 true true 130 147 38
Circle -7500403 true true 192 85 38
Circle -7500403 true true 85 40 38
Circle -7500403 true true 177 40 38
Circle -7500403 true true 177 132 38
Circle -7500403 true true 70 85 38
Circle -7500403 true true 130 25 38
Circle -7500403 true true 96 51 108
Circle -16777216 true false 113 68 74
Polygon -10899396 true false 189 233 219 188 249 173 279 188 234 218
Polygon -10899396 true false 180 255 150 210 105 210 75 240 135 240

house
false
0
Rectangle -7500403 true true 45 120 255 285
Rectangle -16777216 true false 120 210 180 285
Polygon -7500403 true true 15 120 150 15 285 120
Line -16777216 false 30 120 270 120

leaf
false
0
Polygon -7500403 true true 150 210 135 195 120 210 60 210 30 195 60 180 60 165 15 135 30 120 15 105 40 104 45 90 60 90 90 105 105 120 120 120 105 60 120 60 135 30 150 15 165 30 180 60 195 60 180 120 195 120 210 105 240 90 255 90 263 104 285 105 270 120 285 135 240 165 240 180 270 195 240 210 180 210 165 195
Polygon -7500403 true true 135 195 135 240 120 255 105 255 105 285 135 285 165 240 165 195

line
true
0
Line -7500403 true 150 0 150 300

line half
true
0
Line -7500403 true 150 0 150 150

pentagon
false
0
Polygon -7500403 true true 150 15 15 120 60 285 240 285 285 120

person
false
0
Circle -7500403 true true 110 5 80
Polygon -7500403 true true 105 90 120 195 90 285 105 300 135 300 150 225 165 300 195 300 210 285 180 195 195 90
Rectangle -7500403 true true 127 79 172 94
Polygon -7500403 true true 195 90 240 150 225 180 165 105
Polygon -7500403 true true 105 90 60 150 75 180 135 105

plant
false
0
Rectangle -7500403 true true 135 90 165 300
Polygon -7500403 true true 135 255 90 210 45 195 75 255 135 285
Polygon -7500403 true true 165 255 210 210 255 195 225 255 165 285
Polygon -7500403 true true 135 180 90 135 45 120 75 180 135 210
Polygon -7500403 true true 165 180 165 210 225 180 255 120 210 135
Polygon -7500403 true true 135 105 90 60 45 45 75 105 135 135
Polygon -7500403 true true 165 105 165 135 225 105 255 45 210 60
Polygon -7500403 true true 135 90 120 45 150 15 180 45 165 90

sheep
false
15
Circle -1 true true 203 65 88
Circle -1 true true 70 65 162
Circle -1 true true 150 105 120
Polygon -7500403 true false 218 120 240 165 255 165 278 120
Circle -7500403 true false 214 72 67
Rectangle -1 true true 164 223 179 298
Polygon -1 true true 45 285 30 285 30 240 15 195 45 210
Circle -1 true true 3 83 150
Rectangle -1 true true 65 221 80 296
Polygon -1 true true 195 285 210 285 210 240 240 210 195 210
Polygon -7500403 true false 276 85 285 105 302 99 294 83
Polygon -7500403 true false 219 85 210 105 193 99 201 83

square
false
0
Rectangle -7500403 true true 30 30 270 270

square 2
false
0
Rectangle -7500403 true true 30 30 270 270
Rectangle -16777216 true false 60 60 240 240

star
false
0
Polygon -7500403 true true 151 1 185 108 298 108 207 175 242 282 151 216 59 282 94 175 3 108 116 108

target
false
0
Circle -7500403 true true 0 0 300
Circle -16777216 true false 30 30 240
Circle -7500403 true true 60 60 180
Circle -16777216 true false 90 90 120
Circle -7500403 true true 120 120 60

tree
false
0
Circle -7500403 true true 118 3 94
Rectangle -6459832 true false 120 195 180 300
Circle -7500403 true true 65 21 108
Circle -7500403 true true 116 41 127
Circle -7500403 true true 45 90 120
Circle -7500403 true true 104 74 152

triangle
false
0
Polygon -7500403 true true 150 30 15 255 285 255

triangle 2
false
0
Polygon -7500403 true true 150 30 15 255 285 255
Polygon -16777216 true false 151 99 225 223 75 224

truck
false
0
Rectangle -7500403 true true 4 45 195 187
Polygon -7500403 true true 296 193 296 150 259 134 244 104 208 104 207 194
Rectangle -1 true false 195 60 195 105
Polygon -16777216 true false 238 112 252 141 219 141 218 112
Circle -16777216 true false 234 174 42
Rectangle -7500403 true true 181 185 214 194
Circle -16777216 true false 144 174 42
Circle -16777216 true false 24 174 42
Circle -7500403 false true 24 174 42
Circle -7500403 false true 144 174 42
Circle -7500403 false true 234 174 42

turtle
true
0
Polygon -10899396 true false 215 204 240 233 246 254 228 266 215 252 193 210
Polygon -10899396 true false 195 90 225 75 245 75 260 89 269 108 261 124 240 105 225 105 210 105
Polygon -10899396 true false 105 90 75 75 55 75 40 89 31 108 39 124 60 105 75 105 90 105
Polygon -10899396 true false 132 85 134 64 107 51 108 17 150 2 192 18 192 52 169 65 172 87
Polygon -10899396 true false 85 204 60 233 54 254 72 266 85 252 107 210
Polygon -7500403 true true 119 75 179 75 209 101 224 135 220 225 175 261 128 261 81 224 74 135 88 99

wheel
false
0
Circle -7500403 true true 3 3 294
Circle -16777216 true false 30 30 240
Line -7500403 true 150 285 150 15
Line -7500403 true 15 150 285 150
Circle -7500403 true true 120 120 60
Line -7500403 true 216 40 79 269
Line -7500403 true 40 84 269 221
Line -7500403 true 40 216 269 79
Line -7500403 true 84 40 221 269

wolf
false
0
Polygon -16777216 true false 253 133 245 131 245 133
Polygon -7500403 true true 2 194 13 197 30 191 38 193 38 205 20 226 20 257 27 265 38 266 40 260 31 253 31 230 60 206 68 198 75 209 66 228 65 243 82 261 84 268 100 267 103 261 77 239 79 231 100 207 98 196 119 201 143 202 160 195 166 210 172 213 173 238 167 251 160 248 154 265 169 264 178 247 186 240 198 260 200 271 217 271 219 262 207 258 195 230 192 198 210 184 227 164 242 144 259 145 284 151 277 141 293 140 299 134 297 127 273 119 270 105
Polygon -7500403 true true -1 195 14 180 36 166 40 153 53 140 82 131 134 133 159 126 188 115 227 108 236 102 238 98 268 86 269 92 281 87 269 103 269 113

x
false
0
Polygon -7500403 true true 270 75 225 30 30 225 75 270
Polygon -7500403 true true 30 75 75 30 270 225 225 270

@#$#@#$#@
NetLogo 5.3
@#$#@#$#@
@#$#@#$#@
@#$#@#$#@
@#$#@#$#@
@#$#@#$#@
default
0.0
-0.2 0 0.0 1.0
0.0 1 1.0 0.0
0.2 0 0.0 1.0
link direction
true
0
Line -7500403 true 150 150 90 180
Line -7500403 true 150 150 210 180

@#$#@#$#@
0
@#$#@#$#@