Information Aggregation in Standing and Ad Hoc Committees

Information Aggregation in Search Committees

This paper examines how information is aggregated by a committee that has to decide when to end search. Each period, committee members observe private signals about the current alternatives, then vote whether to accept one of these alternatives or continue searching. In a pure common values setting, we extend the result of Austen-Smith and Banks (1996) to this dynamic environment: the only voti...

Information Aggregation and Equilibrium Selection in Committees

Bargaining in Standing Committees

Committee voting has mostly been investigated from the perspective of the standard Baron-Ferejohn model of bargaining over the division of a pie, in which bargaining ends as soon as the committee reaches an agreement. In standing committees, however, existing agreements can be amended. This paper studies an extension of the Baron-Ferejohn framework to a model with an evolving default that refle...

Assessment of DSACC and QPART Algorithms in Ad Hoc Networks

The rapid advancement in wireless over wired has augmented the need for improving theQuality of Service (QoS) over such wireless links. However, the wireless ad hoc networkshave too low bandwidth, and establishing a QoS in these networks is a difficult issue. So,support of quality of service in ad hoc networks is the topical issue among the networkscience researchers. In this research we are go...

Ad Hoc Information Spaces

We describe the concept of ad hoc information spaces as a way of distributing information in an environment depending on user mobility and relative location. Ad hoc information spaces are realised using a decentralised approach to ubiquitous computing, which is based on functionally selfcontained devices and ad hoc networking. Users are able to construct and manipulate the properties of these i...