344 research outputs found

    Doing it when others do: a strategic model of procrastination

    Get PDF
    This paper develops a strategic model of procrastination in which present‐biased agents prefer to perform an onerous task with someone else. This turns their decision of when to perform the task into a procrastination game - a dynamic coordination game between present‐biased players. The model characterizes the conditions under which interaction mitigates or exacerbates procrastination. A procrastinator matched with a worse procrastinator may perform her task earlier than she otherwise would: she wants to avoid the increased temptation that her peer's company would generate. Procrastinators can thus use bad company as a commitment device to mitigate their self‐control problem

    Deciding on behalf of others does not mitigate selfishness: an experiment

    Get PDF
    We test whether deciding on behalf of a passive third party makes participants less selfish in a subsequent decision on behalf of themselves. We find that, in a standard dictator game and in a modified dictator game that allows for "moral wiggle room”, the experience of having decided for others does not mitigate selfishness

    Pay for performance with motivated employees

    Get PDF
    Heterogeneity in intrinsic motivation affects the optimal contract offered to employees in teams. Under individual incentives, the effort exerted by both motivated and selfish employees is distorted. This distortion is mitigated if employees receive a wage based on team performance. As a result, the principal prefers to use team incentives, while motivated employees are better off with individual incentives

    Investment in education under disappointment aversion

    Get PDF
    This paper develops a model of risky investment in education under disappointment aversion, modelled as loss aversion around one's endogenous expectation. The model shows that disappointment aversion reduces investments in education for lower ability people and increases investments for higher ability people, thereby magnifying the gap between them generated by the riskiness of education

    Soft commitment: a study on demand and compliance

    Get PDF
    This article explores the demand for soft, self-imposed commitment, and subsequent compliance behaviour, using a framed field study in a higher education setting. We find a substantial soft commitment demand and a remarkably high failure to comply with the chosen commitment.Students are more likely to demand soft commitment if they expect the task to be more time-consuming and their relative performance to be lower. Failure to comply is associated with previous grade and personality traits. We find no evidence that soft commitment affects grades

    Debarment and collusion in procurement auctions

    Get PDF
    This article presents the first experiment exploring the impact of debarments – the exclusion of colluding bidders – on collusion in procurement auctions. We find that debarments reduce collusion and bids relative to a market with no sanction. The deterrent effect of debarments increases in the length of the punishment. However, shorter debarments reduce efficiency and increase the bids of non-debarred bidders. This suggests that debarments that are too lenient may trigger tacit collusion among the bidders who remain in the market, thereby facilitating the very behavior they aim to deter

    The Cost-Balanced Path Problem: A Mathematical Formulation and Complexity Analysis

    Get PDF
    This paper introduces a new variant of the Shortest Path Problem (SPP) called the Cost-Balanced Path Problem (CBPP). Various real problems can either be modeled as BCPP or include BCPP as a sub-problem. We prove several properties related to the complexity of the CBPP problem. In particular, we demonstrate that the problem is NP-hard in its general version, but it becomes solvable in polynomial time in a specific family of instances. Moreover, a mathematical formulation of the CBPP, as a mixed-integer programming model, is proposed, and some additional constraints for modeling real requirements are given. This paper validates the proposed model and its extensions with experimental tests based on random instances. The analysis of the results of the computational experiments shows that the proposed model and its extension can be used to model many real applications. Obviously, due to the problem complexity, the main limitation of the proposed approach is related to the size of the instances. A heuristic solution approach should be required for larger-sized and more complex instances

    A Constructive Heuristics and an Iterated Neighborhood Search Procedure to Solve the Cost-Balanced Path Problem

    Get PDF
    This paper presents a new heuristic algorithm tailored to solve large instances of an NP-hard variant of the shortest path problem, denoted the cost-balanced path problem, recently proposed in the literature. The problem consists in finding the origin–destination path in a direct graph, having both negative and positive weights associated with the arcs, such that the total sum of the weights of the selected arcs is as close to zero as possible. At least to the authors’ knowledge, there are no solution algorithms for facing this problem. The proposed algorithm integrates a constructive procedure and an improvement procedure, and it is validated thanks to the implementation of an iterated neighborhood search procedure. The reported numerical experimentation shows that the proposed algorithm is computationally very efficient. In particular, the proposed algorithm is most suitable in the case of large instances where it is possible to prove the existence of a perfectly balanced path and thus the optimality of the solution by finding a good percentage of optimal solutions in negligible computational time
    • 

    corecore