This paper introduces a game theoretic setting for prevention of denial of service (DoS) attack in wireless sensor networks consisting of malicious nodes. We propose a protocol based on game theory which achieves the design objectives of truthfulness by recognizing the presence of nodes that agree to forward packets but fail to do so. This approach categorizes different nodes based upon their d...

Lawyers and the legal system have been much criticized in recent years. Despite popular perceptions, the legal system contains numerous mechanisms and rules designed to ensure fair results. This paper shows how the legal system tries to implement, in commercial transactions, the ethical principles of truthfulness and fairness. The AngloAmerican development of Equity Courts is reviewed briefly. ...

With the rise of the interactive “Web 2.0” and the increasing tendency of online publications to turn to message-board style reader feedback venues, informal political discourse has become an important feature of the intellectual landscape of the Internet. We consider innate political bias or “sentiment” to be of interest for a variety of reasons, including as a factor in determining the reliab...

We give a non-trivial class of valuation functions for which we give auctions that are efficient, truthful and envy-free. We give interesting classes of valuations for which one can design such auctions. Surprisingly, we also show that minor modifications to these valuations lead to impossibility results, the most surprising of which is that for a natural class of valuations, one cannot achieve...

Designing truthful mechanisms for scheduling on related machines is a very important problem in single-parameter mechanism design. We consider the covering objective, that is we are interested in maximizing the minimum completion time of a machine. This problem falls into the class of problems where the optimal allocation can be truthfully implemented. A major open issue for this class is wheth...

NTCIR QALab is a competition to computationally solve complex real-world questions. We, ISOFT team, perform the task using a choice verification method. The choice verification method evaluates the truthfulness of each choice by calculating three evidence scores using a knowledgebase, information retrieval, and restriction. We use fundamental natural language processing methods without semantic...

This study reports on the psychometric properties of the Prison Inmate Inventory (PII) a 160-item, 10scale inmate screening tool that includes static factors as well as dynamic factors amenable to change through treatment. The PII includes a Truthfulness Scale to assess offender denial, problem minimization and guardedness, factors associated with treatment completion and recidivism. Reliabilit...

The prospect of using memory modifying technologies raises interesting and important normative concerns. We first point out that those developing desirable memory modifying technologies should keep in mind certain technical and user-limitation issues. We next discuss certain normative issues that the use of these technologies can raise such as truthfulness, appropriate moral reaction, self-know...

In this paper we formalize and initiate the study of heterogeneous k-facility location without money, a problem akin to the classical k-facility location problem but encompassing a richer model and featuring multi-parameter agents. In particular, we consider truthful mechanisms without money for the problem in which heterogeneous (i.e. serving different purposes) facilities have to be located a...

We correct a bound in the definition of approximate truthfulness used body paper Jackson and Sonnenschein (2007). The proof their main theorem uses different permutation-based definition, implicitly claiming that permutation-version implies bound-based version. show this claim holds only if is loosened. new still strong enough to guarantee fraction lies vanishes as number problems grows, so sta...