Auction implementation similar to Dining Philosophers - netlogo

Question

I am trying to implement an auction concept in netlogo - it is similar to the dining philosophers problem program.
My program deals with computers and processors that correspond to philosophers and forks in the dining philosopher program. In the philosophers program a user needs 2 forks to eat but in computers and processors, one computer needs one processor to work.
The states defined in my program are IDLE, NEED, USING, corresponding to THINKING, HUNGRY, EATING in the philosopher program.
Currently, my program goes to the point where all computers state changes to NEED. I am having issues in acquiring of server for the computers.
The code snippet is -
// ... lines of code for declaration etc
.
.
.
to update
if state = "IDLE" [
if random-float 1.0 < hungry-chance [
set state "NEED"
]
stop
]
if state = "USING" [
set total-used (total-used + 1)
if random-float 1.0 < full-chance
[ release-servers ]
set state "IDLE"
stop
]
if state = "NEED"
[ acquire-servers ]
if we've got both forks, eat.
if got? servers
[ set state "USING" ]
stop
end
//lines of code in between
.
.
to acquire-servers ;; philosopher procedure
ask servers [
if [owner] of servers = nobody[
set owner myself
move-to owner
set heading [heading] of owner
]
]
end
// lines of code at end

Answer 1

First, you need to change your if for testing state into ifelse and remove the stop commands. That way, the computer will find its correct state and do the relevant procedures and then not look at the other states.
Second, the acquire-servers procedure currently assigns all the servers to the first computer that needs one. You probably want a procedure that looks more like:
to acquire-one-server
let candidates servers with [ owner = nobody ]
if any? candidates
[ ask one-of candidates
[ set owner myself
move-to owner
set heading [heading] of owner
]
]
end