Heritage, crisis, and community crime prevention in Nepal

Following Nepal's 2015 earthquake there was speculation that sacred art would be looted from the ruins of severely damaged temples due to breakdown in formal security. Although pillage did not immediately occur, the months following the earthquake have seen the theft of sacred heritage items. As Nepali sacred art remains under threat of theft, we explore the processes by which government intervention can be destructive of the community dynamic that maintains local crime prevention on an informal and unofficial level. Can situational crime prevention measures when imposed in a top-down fashion upon communities by state actors be corrosive of collective efficacy, and therefore ultimately self-defeating in crime prevention terms? The case of post-quake Nepal seems to suggest that the answer to this question is, in some circumstances, yes

Criminology towards the metaverse: Cryptocurrency scams, grey economy and the technosocial

Online markets in cryptocurrency represent a sprawling and eclectic alternative financial system, selling cutting edge techno-investment schemes that are complex and high risk. Crime control is almost entirely absent from this new crypto economy, and it is full of scams. This paper draws on an ethnography of crypto trading to review the main types of scam, suggesting that the grey economy of cryptocurrency trading is part of a wider evolution of society towards the technosocial, and beyond that perhaps towards the metaversal

Fair assignment of indivisible objects under ordinal preferences

We consider the discrete assignment problem in which agents express ordinal preferences over objects and these objects are allocated to the agents in a fair manner. We use the stochastic dominance relation between fractional or randomized allocations to systematically define varying notions of proportionality and envy-freeness for discrete assignments. The computational complexity of checking whether a fair assignment exists is studied for these fairness notions. We also characterize the conditions under which a fair assignment is guaranteed to exist. For a number of fairness concepts, polynomial-time algorithms are presented to check whether a fair assignment exists. Our algorithmic results also extend to the case of unequal entitlements of agents. Our NP-hardness result, which holds for several variants of envy-freeness, answers an open question posed by Bouveret, Endriss, and Lang (ECAI 2010). We also propose fairness concepts that always suggest a non-empty set of assignments with meaningful fairness properties. Among these concepts, optimal proportionality and optimal weak proportionality appear to be desirable fairness concepts.Comment: extended version of a paper presented at AAMAS 201

Complexity of Manipulating Sequential Allocation

Sequential allocation is a simple allocation mechanism in which agents are given pre-specified turns and each agents gets the most preferred item that is still available. It has long been known that sequential allocation is not strategyproof. Bouveret and Lang (2014) presented a polynomial-time algorithm to compute a best response of an agent with respect to additively separable utilities and claimed that (1) their algorithm correctly finds a best response, and (2) each best response results in the same allocation for the manipulator. We show that both claims are false via an example. We then show that in fact the problem of computing a best response is NP-complete. On the other hand, the insights and results of Bouveret and Lang (2014) for the case of two agents still hold

Identifying innovative and effective practice in e-assessment: findings from seventeen UK case studies

The aim of this JISC funded project was to extend the understanding of what e-assessment meant to users and producers in the HE and FE sectors. A case study methodology was employed to identify and report upon best and current practice within this field of inquiry. This approach facilitated the identification of both the enabling factors and barriers associated with e-assessment. The variety of applications of e-assessment studied and their innovation and general effectiveness indicate the potential of e-assessment to significantly enhance the learning environment and the outcomes for students, in a wide range of disciplines and applications

Collectors on illicit collecting: Higher loyalties and other techniques of neutralization in the unlawful collecting of rare and precious orchids and antiquities

Trafficking natural objects and trafficking cultural objects have been treated separately both in regulatory policy and in criminological discussion. The former is generally taken to be ‘wildlife crime’ while the latter has come to be considered under the auspices of a debate on ‘illicit art and antiquities’. In this article we study the narrative discourse of high-end collectors of orchids and antiquities. The illicit parts of these global trades are subject to this analytical divide between wildlife trafficking and art trafficking, and this has resulted in quite different regulatory structures for each of these markets. However, the trafficking routines, the types and levels of harm involved, and the supply–demand dynamics in the trafficking of orchids and antiquities are actually quite similar, and in this study we find those structural similarities reflected in substantial common ground in the way collectors talk about their role in each market. Collectors of rare and precious orchids and antiquities valorize their participation in markets that are known to be in quite considerable degree illicit, appealing to ‘higher loyalties’ such as preservation, appreciation of aesthetic beauty and cultural edification. These higher loyalties, along with other techniques of neutralization, deplete the force of law as a guide to appropriate action. We propose that the appeal to higher loyalties is difficult to categorize as a technique of neutralization in this study as it appears to be a motivational explanation for the collectors involved. The other classic techniques of neutralization are deflective, guilt and critique reducing narrative mechanisms, while higher loyalties drives illicit behaviour in collecting markets for orchids and antiquities in ways that go significantly beyond the normal definition of neutralization

Computational Aspects of Multi-Winner Approval Voting

We study computational aspects of three prominent voting rules that use approval ballots to elect multiple winners. These rules are satisfaction approval voting, proportional approval voting, and reweighted approval voting. We first show that computing the winner for proportional approval voting is NP-hard, closing a long standing open problem. As none of the rules are strategyproof, even for dichotomous preferences, we study various strategic aspects of the rules. In particular, we examine the computational complexity of computing a best response for both a single agent and a group of agents. In many settings, we show that it is NP-hard for an agent or agents to compute how best to vote given a fixed set of approval ballots from the other agents