Life presents us with problems of varying complexity. Yet, complexity is not accounted for in theories of human decision-making. Here we study instances of the knapsack problem, a discrete optimisation problem commonly encountered at all levels of cognition, from attention gating to intellectual discovery. Complexity of this problem is well understood from the perspective of a mechanical device like a computer. We show experimentally that human performance too decreased with complexity as defined in computer science. Defying traditional economic principles, participants spent effort way beyond the point where marginal gain was positive, and economic performance increased with instance difficulty. Human attempts at solving the instances exhibited commonalities with algorithms developed for computers, although biological resource constraints-limited working and episodic memories-had noticeable impact. Consistent with the very nature of the knapsack problem, only a minority of participants found the solution-often quickly-but the ones who did appeared not to realise. Substantial heterogeneity emerged, suggesting why prizes and patents, schemes that incentivise intellectual discovery but discourage information sharing, have been found to be less effective than mechanisms that reveal private information, such as markets.
Download full-text PDF |
Source |
---|---|
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC5054396 | PMC |
http://dx.doi.org/10.1038/srep34851 | DOI Listing |
PLoS One
January 2025
Department of Health and Wellness, Cape Winelands District, Ceres, South Africa.
Despite much literature on operations research applied to various healthcare problems, impactful implementation in public healthcare is limited, which often results in allocative inefficiency. This article uses a mobile clinic routing and scheduling problem in the Witzenberg region of South Africa as a case study to demonstrate the improvement of implementation success through cross-disciplinary collaboration, and also to propose a new three-stage approach for modelling a mobile clinic problem that incorporates continuity of care, fairness, and minimisation of distance travelled. Mobile clinics are used in many countries to improve access to healthcare for rural communities.
View Article and Find Full Text PDFSensors (Basel)
October 2024
Beijing Key Laboratory of Network System Architecture and Convergence, Beijing University of Posts and Telecommunications, Beijing 100876, China.
The widespread adoption of Internet of Things (IoT) applications has driven the demand for obtaining sensor data. Using unmanned aerial vehicles (UAVs) to collect sensor data is an effective means in scenarios with no ground communication facilities. In this paper, we innovatively consider an indeterministic data collection task in a UAV-assisted wide and sparse wireless sensor network, where the wireless sensor nodes (SNs) obtain effective data randomly, and the UAV has no pre-knowledge about which sensor has effective data.
View Article and Find Full Text PDFSensors (Basel)
September 2024
School of Computer Science, Software and Cyberspace Security, Nanjing University of Posts and Telecommunications, Nanjing 210003, China.
With the development of the IoT, Wireless Rechargeable Sensor Networks (WRSNs) derive more and more application scenarios with diverse performance requirements. In scenarios where the energy consumption rate of sensor nodes changes dynamically, most existing charging scheduling methods are not applicable. The incorrect estimation of node energy requirement may lead to the death of critical nodes, resulting in missing events.
View Article and Find Full Text PDFPLoS Comput Biol
September 2024
Centre for Brain, Mind and Markets The University of Melbourne, Melbourne, Victoria, Australia.
Many everyday tasks require people to solve computationally complex problems. However, little is known about the effects of computational hardness on the neural processes associated with solving such problems. Here, we draw on computational complexity theory to address this issue.
View Article and Find Full Text PDFPLoS One
September 2024
Department of Computer Science, Sangmyung University, Seoul, South Korea.
In 2009, Lyubashevsky proposed a lattice-based signature scheme using the Schnorr-like identification and the Fiat-Shamir heuristic and proved its security under the collision resistance of a generalized compact knapsack function. However, their security analysis requires the witness indistinguishability property, leading to significant inefficiency and an increase of sizes of public key and signature. To overcome the efficiency issue associated with the WI property, we introduce a new lattice-based assumption, called the target-modified one-wayness problem of the GCK function and show its reduction to well-known lattice-based problems.
View Article and Find Full Text PDFEnter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!