We give near optimal bufferless routing algorithms for leveled networks. N packets with preselected paths are given, and once injected, the packets may not be buffered while in transit to their destination. For the preselected paths, the dilation D is the maximum path length, and the congestion C is the maximum number of times an edge is used. We give two bufferless routing algorithms for level...

In automated negotiation systems consisting of self-interested agents, contracts have traditionally been binding. Leveled commitment contracts — i.e., contracts where each party can decommit by paying a predetermined penalty — were recently shown to improve expected social welfare even if agents decommit strategically in Nash equilibrium. Such contracts differ based on whether agents have to de...

We present efficient emulations of the CRCW PRAM on a large class of processor interconnection networks called leveled networks. This class includes the star graph and the n-way shuffle, which have the interesting property that the network diameter is sub-logarithmic in the network size. We show that a CRCW PRAM can be emulated optimally on these networks (i.e., each emulation step takes time l...