Concept

Principle of least effort

The principle of least effort is a broad theory that covers diverse fields from evolutionary biology to webpage design. It postulates that animals, people, and even well-designed machines will naturally choose the path of least resistance or "effort." It is closely related to many other similar principles (see principle of least action or other articles listed below). This is perhaps best known, or at least documented, among researchers in the field of library and information science. Their principle states that an information-seeking client will tend to use the most convenient search method in the least exacting mode available. Information-seeking behavior stops as soon as minimally acceptable results are found. This theory holds true regardless of the user's proficiency as a searcher, or their level of subject expertise. Also, this theory takes into account the user’s previous information-seeking experience. The user will use the tools that are most familiar and easy to use that find results. The principle of least effort is known as a “deterministic description of human behavior”. The principle of least effort applies not only in the library context, but also to any information-seeking activity. For example, one might consult a generalist co-worker down the hall rather than a specialist in another building, so long as the generalist's answers were within the threshold of acceptability. The principle of least effort is analogous to the path of least resistance. The principle was first articulated by the Italian philosopher Guillaume Ferrero in an article in the Revue philosophique de la France et de l'étranger, 1 January 1894. About fifty years later, this principle was studied by linguist George Kingsley Zipf who wrote Human Behaviour and the Principle of Least Effort: An Introduction to Human Ecology, first published in 1949. He theorised that the distribution of word use was due to tendency to communicate efficiently with least effort and this theory is known as Zipf's Law.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.