Goto

Collaborating Authors



'PJ Masks' Tech Toys Add Lights, Sound And Articulation

Forbes - Tech

Growing from strength to strength and approaching its second season, PJ Masks is fast becoming the talk of the playground. The show that airs on Disney Junior revolves around three children heroes who gain special power when they put on their pyjama super-hero outfits. Along with an existing line of children's toys, and interactive website and the recent Moonlight Heroes, Hidden Heroes and PJ Masks Super City Run app, we now have a set of more tech enabled toys. These super-size some of the existing vehicles to add in more interactive elements. The PJ Masks Deluxe Cat-Car is a large blue incarnation of one of the vehicles that appears in the show.


Manipulation of Nanson's and Baldwin's Rules

arXiv.org Artificial Intelligence

Nanson's and Baldwin's voting rules select a winner by successively eliminating candidates with low Borda scores. We show that these rules have a number of desirable computational properties. In particular, with unweighted votes, it is NP-hard to manipulate either rule with one manipulator, whilst with weighted votes, it is NP-hard to manipulate either rule with a small number of candidates and a coalition of manipulators. As only a couple of other voting rules are known to be NP-hard to manipulate with a single manipulator, Nanson's and Baldwin's rules appear to be particularly resistant to manipulation from a theoretical perspective. We also propose a number of approximation methods for manipulating these two rules. Experiments demonstrate that both rules are often difficult to manipulate in practice. These results suggest that elimination style voting rules deserve further study.


Manipulation of Nanson's and Baldwin's Rules

AAAI Conferences

Nanson's and Baldwin's voting rules selecta winner by successively eliminatingcandidates with low Borda scores. We showthat these rules have a number of desirablecomputational properties. In particular,with unweighted votes, it isNP-hard to manipulate either rule with one manipulator, whilstwith weighted votes, it isNP-hard to manipulate either rule with a small number ofcandidates and a coalition of manipulators.As only a couple of other voting rulesare known to be NP-hard to manipulatewith a single manipulator, Nanson'sand Baldwin's rules appearto be particularly resistant to manipulation from a theoretical perspective.We also propose a number of approximation methodsfor manipulating these two rules.Experiments demonstrate that both rules areoften difficult to manipulate in practice.These results suggest that elimination stylevoting rules deserve further study.