Item Details

abstract

This thesis studies deterministic movement over toroidal grids (and more generally, Cayley graphs on groups), integrating local information, bounded memory and choice at individual nodes. The research is motivated by recent work on deterministic random walks, and applications in multi-agent systems. Several results regarding passing tokens through toroidal grids are discussed, as well as some open questions.

subject

contributor

Beeler, Katy (author)

Berenhaut, Kenneth S (committee chair)

Mason, Sarah (committee member)

date

2013-06-06T21:19:28Z (accessioned)

2013 (issued)

degree

Mathematics (discipline)

10000-01-01 (liftdate)

embargo

forever (terms)

identifier

http://hdl.handle.net/10339/38535 (uri)

language

en (iso)

publisher

Wake Forest University

title

Achieving Fair Distribution with Choice

type

Thesis