The n-duel problem, solved for n = 4 and generalised

The n-duel problem is something those of us who solve puzzles may have come across in a simplified manner. There are n archers/gunmen/assassins/whatever(I'll go with archers for the purpose of this post) who agree to participate in a turn-based battle. Each of them have 1/n, 2/n, 3/n...n/n probability of killing their target when they shoot. The rules of their engagement are:
1.If there is one person left alive, that person is the winner.
2.If there are multiple people left alive, at any time, it is the turn of the person alive who has shot the least number of arrows to shoot.
3.If there are multiple people who satisfy this criterion, it is the turn of the person who has the lesser accuracy to shoot.

The problem is to determine the ideal strategy for the a/g/a with accuracy 1/n, given that all archers are perfectly rational.

If you haven't solved the puzzle for n=3, stop now and try it. This post will include the answer to it.

I originally saw the generalised version of the puzzle on puzzling.stackexchange.

Hello World!

Hello world! I'm a random person from somewhere in the middle of somewhere, and I have opinions.

That's right, opinions *gasp*. That I don't necessarily always want to keep to myself. Since blogs are things in this day and age, I thought I could occasionally put things up for the rest of the world to see.

I won't promise any kind of schedule, because I know I won't keep it, but I'll try to put things up as often as I can.

To start this off, I'll put up a post about the n-way archer problem.