26,308 research outputs found

    Using Incentives to Obtain Truthful Information

    Get PDF
    There are many scenarios where we would like agents to report their observations or expertise in a truthful way. Game-theoretic principles can be used to provide incentives to do so. I survey several approaches to eliciting truthful information, in particular scoring rules, peer prediction methods and opinion polls, and discuss possible applications

    Credibility-Based Binary Feedback Model for Grid Resource Planning

    Get PDF
    In commercial grids, Grid Service Providers (GSPs) can improve their profitability by maintaining the lowest possible amount of resources to meet client demand. Their goal is to maximize profits by optimizing resource planning. In order to achieve this goal, they require an estimate of the demand for their service, but collecting demand data is costly and difficult. In this paper we develop an approach to building a proxy for demand, which we call a value profile. To construct a value profile, we use binary feedback from a collection of heterogeneous clients. We show that this can be used as a proxy for a demand function that represents a client’s willingness-to-pay for grid resources. As with all binary feedback systems, clients may require incentives to provide feedback and deterrents to selfish behavior, such as misrepresenting their true preferences to obtain superior services at lower costs. We use credibility mechanisms to detect untruthful feedback and penalize insincere or biased clients. Finally, we use game theory to study how cooperation can emerge in this community of clients and GSPs

    A Truthful Mechanism for the Generalized Assignment Problem

    Full text link
    We propose a truthful-in-expectation, (1−1/e)(1-1/e)-approximation mechanism for a strategic variant of the generalized assignment problem (GAP). In GAP, a set of items has to be optimally assigned to a set of bins without exceeding the capacity of any singular bin. In the strategic variant of the problem we study, values for assigning items to bins are the private information of bidders and the mechanism should provide bidders with incentives to truthfully report their values. The approximation ratio of the mechanism is a significant improvement over the approximation ratio of the existing truthful mechanism for GAP. The proposed mechanism comprises a novel convex optimization program as the allocation rule as well as an appropriate payment rule. To implement the convex program in polynomial time, we propose a fractional local search algorithm which approximates the optimal solution within an arbitrarily small error leading to an approximately truthful-in-expectation mechanism. The presented algorithm improves upon the existing optimization algorithms for GAP in terms of simplicity and runtime while the approximation ratio closely matches the best approximation ratio given for GAP when all inputs are publicly known.Comment: 18 pages, Earlier version accepted at WINE 201

    Private provision of public goods and information diffusion in social groups

    Get PDF
    We describe a model of fundraising in social groups, where private information about quality of provision is transmitted by social proximity. Individuals engage in voluntary provision of a pure collective good that is consumed by both neighbours and non-neighbours. We show that, unlike in the case of private goods, better informed individuals face positive incentives to incur a cost to share information with their neighbours. These incentives are stronger, and provision of the pure public good greater, the smaller are individuals’ social neighbourhoods
    • 

    corecore