This paper describes a smart radio network that can facilitate communication of radios operating under congested conditions in the 2.4 GHz unlicensed band. The network detects legacy systems spectrally, temporally, and spatially, and implements a novel avoidance technique to reduce or remove interference with the legacy systems. The system was designed by a team of students from Carnegie Mellon...

We analyze traffic data from a highway section containing one effective on-ramp. Based on two criteria, local velocity variation patterns and expansion (or nonexpansion) of congested regions, three distinct congested traffic states are identified. These states appear at different levels of the upstream flux and the on-ramp flux, thereby generating a phase digram of the congested traffic flow. O...

In this paper, we introduce a continuous-time model aimed at capturing the dynamics of congested Internet connections. The model combines a system of differential equations with a sudden change in one of the state variables. Results from this model show good agreement with the well-known ns network simulator, better than the results of a previous, similar model. This is due in large part to the...

We study observational learning in environments with congestion costs: as more of one’s predecessors choose an action, the payoff from choosing that action decreases. Herds cannot occur if congestion on an action can get so large that an agent would prefer to take a different action no matter what his beliefs about the state. To the extent that “switching” away from the more popular action also...

Auctions are a widely used approach for determining the current market price for congested resources. However, using them for real systems, such as the Internet, the auction algorithms require modifications as soon as connections cover links from more than one Internet Service Provider. This paper presents work in progress on two new auction schemes that have been designed to overcome this prob...

We study machine learning-based assistants that support coordination between humans in congested facilities via congestion forecasts. In our theoretical analysis, we use game theory to study how an assistant's forecast that influences the outcome relates to Nash equilibria, and how they can be reached quickly in congestion game-like settings. Using information theory, we investigate approximati...

The congested clique is a synchronous, message-passing model of distributed computing in which each computational unit (node) in each round can send message of O(log n) bits to each other node of the network, where n is the number of nodes. This model has been considered under two extreme scanarios: unicast or broadcast. In the unicast model, a node can send (possibly) different message to each...