Bandwidth Allocation in Tactical Data Links via Mechanism Design

AbstractOur research focusses on improving the quality and accuracy of the common operating picture of a tactical scenario through the efficient allocation of bandwidth in the tactical data networks among self-interested actors, who may resort to strategic behaviour dictated by self-interest. We propose a two-stage bandwidth allocation mechanism based on modified strictly-proper scoring rules, whereby multiple agents can provide track data estimates of limited precisions and the centre does not have to rely on knowledge of the true state of the world when calculating payments. In particular, our work emphasizes the importance of applying robust optimization techniques to deal with the data uncertainty in the operating environment. We apply our robust optimization – based scoring rules mechanism to an agent-based model framework of the tactical defence scenario, and analyse the results obtained

Eliciting Truthful Measurements from a Community of Sensors

As the Internet of Things grows to large scale, its components will increasingly be controlled by self-interested agents. For example, sensor networks will evolve to community sensing where a community of agents combine their data into a single coherent structure. As there is no central quality control, agents need to be incentivized to provide accurate measurements. We propose game-theoretic mechanisms that provide such incentives and show their application on the example of community sensing for monitoring air pollution. These mechanisms can be applied to most sensing scenarios and allow the Internet of Things to grow to much larger scale than currently exists

Buying Private Data without Verification

We consider the problem of designing a survey to aggregate non-verifiable information from a privacy-sensitive population: an analyst wants to compute some aggregate statistic from the private bits held by each member of a population, but cannot verify the correctness of the bits reported by participants in his survey. Individuals in the population are strategic agents with a cost for privacy, \ie, they not only account for the payments they expect to receive from the mechanism, but also their privacy costs from any information revealed about them by the mechanism's outcome---the computed statistic as well as the payments---to determine their utilities. How can the analyst design payments to obtain an accurate estimate of the population statistic when individuals strategically decide both whether to participate and whether to truthfully report their sensitive information? We design a differentially private peer-prediction mechanism that supports accurate estimation of the population statistic as a Bayes-Nash equilibrium in settings where agents have explicit preferences for privacy. The mechanism requires knowledge of the marginal prior distribution on bits $b_i$, but does not need full knowledge of the marginal distribution on the costs $c_i$, instead requiring only an approximate upper bound. Our mechanism guarantees $\epsilon$-differential privacy to each agent $i$ against any adversary who can observe the statistical estimate output by the mechanism, as well as the payments made to the $n-1$ other agents $j\neq i$. Finally, we show that with slightly more structured assumptions on the privacy cost functions of each agent, the cost of running the survey goes to $0$ as the number of agents diverges.Comment: Appears in EC 201

Mechanism design for the truthful elicitation of costly probabilistic estimates in distributed information systems

This paper reports on the design of a novel two-stage mechanism, based on strictly proper scoring rules, that allows a centre to acquire a costly forecast of a future event (such as a meteorological phenomenon or a probabilistic estimate of a specific parameter such as the quality of an expected service), with a specified minimum precision, from one or more agents. In particular, this is the first mechanism that can be applied in a setting where the centre has no knowledge about the actual costs involved in the generation of the agents' estimates and also has no means of evaluating the quality and accuracy of the estimates it receives. En route to this mechanism, we first consider a setting in which any single agent can provide an estimate of the required precision, and the centre can evaluate this estimate by comparing it with the outcome which is observed at a later stage. This mechanism is then extended, so that it can be applied in a setting where the agents' different capabilities are reflected in the maximum precision of the estimates that they can provide, and hence the centre may need to select multiple agents and combine their individual results in order to obtain an estimate of the required precision. For all three mechanisms, we prove their economic properties (i.e. incentive compatibility and individual rationality) and then present specific empirical results. For the single agent mechanism we compare the quadratic, spherical and logarithmic scoring rules with a parametric family of scoring rules. We show that although the logarithmic scoring rule minimises both the mean and variance of the centre's total payments, using this rule means that an agent may face an unbounded penalty if it provides an estimate of extremely poor quality. We show that this is not the case for the parametric family, and thus, we suggest that the parametric scoring rule is the best candidate in our setting. Furthermore, we show that the 'multiple agent' extension describes a family of possible approaches to select agents in the first stage of our mechanism, and we show empirically and prove analytically that there is one approach that dominates all others. Finally, we compare our novel contribution and with the peer prediction mechanism introduced by Miller et al. (2007) [29] and show that the centre's total expected payment is the same in both mechanisms (and is equal to total expected payment in the case that the estimates can be compared to the actual outcome), while the variance in these payments is significantly reduced within our mechanism

Eliciting Truthful Measurements from a Community of Sensors

As the Internet of Things grows to large scale, its components will increasingly be controlled by selfinterested agents. For example, sensor networks will evolve to community sensing where a community of agents combine their data into a single coherent structure. As there is no central quality control, agents need to be incentivized to provide accurate measurements. We propose game-theoretic mechanisms that provide such incentives and show their application on the example of community sensing for monitoring air pollution. These mechanisms can be applied to most sensing scenarios and allow the Internet of Things to grow to much larger scale than currently exists

Prediction Markets:A literature review 2014

In recent years, Prediction Markets gained growing interest as a forecasting tool among researchers as well as practitioners, which resulted in an increasing number of publications. In order to track the latest development of research, comprising the extent and focus of research, this article provides a comprehensive review and classification of the literature related to the topic of Prediction Markets. Overall, 304 relevant articles, published in the timeframe from 2007 through 2013, were identified and assigned to a herein presented classification scheme, differentiating between descriptive works, articles of theoretical nature, application-oriented studies and articles dealing with the topic of law and policy. The analysis of the research results reveals that more than half of the literature pool deals with the application and actual function tests of Prediction Markets. The results are further compared to two previous works published by Zhao, Wagner and Chen (2008) and Tziralis and Tatsiopoulos (2007a). The article concludes with an extended bibliography section and may therefore serve as a guidance and basis for further research. (250 WORDS

Limiting the Influence of Low Quality Information in Community Sensing

We consider a community of private sensors that collect measurements of a physical phenomenon, such as air pollution, and report it to a center. The center should be able to prevent low quality reports from degrading the quality of the aggregated information, as there are numerous reasons for operators to inject false sensor data. Hence, it is necessary to track the quality of the sensors over time in order to filter out low quality and malicious reports. To achieve this, we construct a reputation system with a guaranteed bounds on negative impact that malicious sensors can cause, and we evaluate its performance on a realistic dataset

Multi-dimensional procurement auction under uncertain and asymmetric information

This article addresses two important issues in public procurement: ex ante uncertainty about the participating agents’ qualities and costs and their strategic behaviour. We present a novel multi-dimensional auction that incentivises agents to make a partial inquiry into the procured task and to honestly report quality-cost probabilistic estimates based on which the principal can choose the agent that offers the best value for money. The mechanism extends second score auction design to settings where the quality is uncertain and it provides incentives to both collect information and deliver desired qualities