Monjardet, Bernard 1938
Overview
Works:  37 works in 134 publications in 3 languages and 1,648 library holdings 

Roles:  Author, Thesis advisor, Compiler, Other, Contributor 
Publication Timeline
.
Most widely held works by
Bernard Monjardet
Utility maximization, choice and preference by
F. T Aleskerov(
)
28 editions published between 2006 and 2014 in English and held by 498 WorldCat member libraries worldwide
"The utility maximization paradigm forms the basis of many economic, psychological, cognitive and behavioral models. Since it was first devised in the eighteenth century, numerous examples have revealed the deficiencies of the concept. This book makes a contribution to overcome those deficiencies by taking into account insensitivity of measurement threshold and context of choice. It covers classic theory as a special, contextfree case and gives a systematic overview of new models of utility maximization within a contextdependent threshold as well as related preference and choice models. The second edition has been updated to include the most recent developments and a new chapter on classic and new results for infinite sets. The presented models will be helpful to scientists in economics, decision making theory, social choice theory, behavioral and cognitive sciences, and related fields."Jacket
28 editions published between 2006 and 2014 in English and held by 498 WorldCat member libraries worldwide
"The utility maximization paradigm forms the basis of many economic, psychological, cognitive and behavioral models. Since it was first devised in the eighteenth century, numerous examples have revealed the deficiencies of the concept. This book makes a contribution to overcome those deficiencies by taking into account insensitivity of measurement threshold and context of choice. It covers classic theory as a special, contextfree case and gives a systematic overview of new models of utility maximization within a contextdependent threshold as well as related preference and choice models. The second edition has been updated to include the most recent developments and a new chapter on classic and new results for infinite sets. The presented models will be helpful to scientists in economics, decision making theory, social choice theory, behavioral and cognitive sciences, and related fields."Jacket
Ensembles ordonnés finis : concepts, résultats et usages by
Nathalie Caspard(
)
16 editions published in 2007 in 3 languages and held by 386 WorldCat member libraries worldwide
Les notions d'ordre, de classement, de rangement sont présentés dans de multiples activités et situations humaines. La formalisation mathématique de ces notions a permis d'abord le grand développement de la théorie des treillis, puis celui de structures ordonnées plus générales, notamment celles relevant des mathématiques discrètes. Les buts principaux de cet ouvrage qui comble un vide sont donc de:  donner les concepts et résultats fondamentaux sur les ensembles ordonnés finis,  présenter leurs usages dans des domaines variés (de la RO ou l'IA à la microéconomie),  signaler un certain nombre de résultats et de recherches en cours. Le lecteur sera ainsi à même de trouver tout ce qu'il a besoin de connaître sur ces structures sans devoir le rechercher dans de multiples revues relevant de disciplines variées
16 editions published in 2007 in 3 languages and held by 386 WorldCat member libraries worldwide
Les notions d'ordre, de classement, de rangement sont présentés dans de multiples activités et situations humaines. La formalisation mathématique de ces notions a permis d'abord le grand développement de la théorie des treillis, puis celui de structures ordonnées plus générales, notamment celles relevant des mathématiques discrètes. Les buts principaux de cet ouvrage qui comble un vide sont donc de:  donner les concepts et résultats fondamentaux sur les ensembles ordonnés finis,  présenter leurs usages dans des domaines variés (de la RO ou l'IA à la microéconomie),  signaler un certain nombre de résultats et de recherches en cours. Le lecteur sera ainsi à même de trouver tout ce qu'il a besoin de connaître sur ces structures sans devoir le rechercher dans de multiples revues relevant de disciplines variées
Finite ordered sets : concepts, results and uses by
Nathalie Caspard(
Book
)
17 editions published between 2012 and 2013 in English and held by 309 WorldCat member libraries worldwide
"Ordered sets are ubiquitous in mathematics and have significant applications in computer science, statistics, biology and the social sciences. As the first book to deal exclusively with finite ordered sets, this book will be welcomed by graduate students and researchers in all of these areas. Beginning with definitions of key concepts and fundamental results (Dilworth's and Sperner's theorem, interval and semiorders, Galois connection, duality with distributive lattices, coding and dimension theory), the authors then present applications of these structures in fields such as preference modelling and aggregation, operational research and management, cluster and concept analysis, and data mining. Exercises are included at the end of each chapter with helpful hints provided for some of the most difficult examples. The authors also point to further topics of ongoing research"
17 editions published between 2012 and 2013 in English and held by 309 WorldCat member libraries worldwide
"Ordered sets are ubiquitous in mathematics and have significant applications in computer science, statistics, biology and the social sciences. As the first book to deal exclusively with finite ordered sets, this book will be welcomed by graduate students and researchers in all of these areas. Beginning with definitions of key concepts and fundamental results (Dilworth's and Sperner's theorem, interval and semiorders, Galois connection, duality with distributive lattices, coding and dimension theory), the authors then present applications of these structures in fields such as preference modelling and aggregation, operational research and management, cluster and concept analysis, and data mining. Exercises are included at the end of each chapter with helpful hints provided for some of the most difficult examples. The authors also point to further topics of ongoing research"
Utility maximization, choice and preference by
F. T Aleskerov(
Book
)
14 editions published between 2002 and 2007 in English and held by 257 WorldCat member libraries worldwide
A classically rational subject is a maximiser: he chooses the best alternative(s) according to some utility function, a paradigm going back to the eighteenth century. One of the ways to overcome its wellknown deficiences is to extend it to take into account insenitivity threshold as well as the context of choice. This book gives a systematic overview on the extended utility maximisation theory covering the classic theory, the theory of utility maximisation within a contextfree or contextdependent threshold, and the related preference and choice models. The presented models will be helpful to specialists in economics, decision making theory, social choice theory, behavioral and cognitive sciences, and related fields
14 editions published between 2002 and 2007 in English and held by 257 WorldCat member libraries worldwide
A classically rational subject is a maximiser: he chooses the best alternative(s) according to some utility function, a paradigm going back to the eighteenth century. One of the ways to overcome its wellknown deficiences is to extend it to take into account insenitivity threshold as well as the context of choice. This book gives a systematic overview on the extended utility maximisation theory covering the classic theory, the theory of utility maximisation within a contextfree or contextdependent threshold, and the related preference and choice models. The presented models will be helpful to specialists in economics, decision making theory, social choice theory, behavioral and cognitive sciences, and related fields
Ordre et classification : algèbre et combinatoire. T. 1 by
Marc Barbut(
Book
)
12 editions published in 1970 in French and Undetermined and held by 97 WorldCat member libraries worldwide
12 editions published in 1970 in French and Undetermined and held by 97 WorldCat member libraries worldwide
Ensembles ordonnés finis : concepts, résultats et usages by
Nathalie Caspard(
)
3 editions published in 2007 in English and French and held by 22 WorldCat member libraries worldwide
3 editions published in 2007 in English and French and held by 22 WorldCat member libraries worldwide
Ensembles ordonnés finis : concepts, résultats et usages (Mathématiques et Applications) (French Edition) by
Nathalie Caspard(
)
1 edition published in 2007 in French and held by 17 WorldCat member libraries worldwide
Les buts principaux de cet ouvrage qui comble un vide sont de :  donner les concepts et résultats fondamentaux sur les ensembles ordonnés finis,  présenter leurs usages dans des domaines variés (de la RO ou l'IA à la microéconomie),  signaler un certain nombre de résultats et de recherches en cours
1 edition published in 2007 in French and held by 17 WorldCat member libraries worldwide
Les buts principaux de cet ouvrage qui comble un vide sont de :  donner les concepts et résultats fondamentaux sur les ensembles ordonnés finis,  présenter leurs usages dans des domaines variés (de la RO ou l'IA à la microéconomie),  signaler un certain nombre de résultats et de recherches en cours
Utility Maximization, Choice and Preference by
F. T Aleskerov(
)
3 editions published in 2007 in English and held by 9 WorldCat member libraries worldwide
3 editions published in 2007 in English and held by 9 WorldCat member libraries worldwide
Ordre et classification : algèbre et combinatoire by
Marc Barbut(
Book
)
3 editions published in 1970 in French and held by 7 WorldCat member libraries worldwide
3 editions published in 1970 in French and held by 7 WorldCat member libraries worldwide
Utility maximization, choice and preference(
Book
)
3 editions published in 2007 in English and held by 6 WorldCat member libraries worldwide
The utility maximization paradigm forms the basis of many economic, psychological, cognitive and behavioral models. Since it was first devised in the eighteenth century, numerous examples have revealed the deficiencies of the concept. This book makes a contribution to overcome those deficiencies by taking into account insensitivity of measurement threshold and context of choice. It covers classic theory as a special, contextfree case and gives a systematic overview of new models of utility maximization within a contextdependent threshold as well as related preference and choice models. The second edition has been updated to include the most recent developments and a new chapter on classic and new results for infinite sets. The presented models will be helpful to scientists in economics, decision making theory, social choice theory, behavioral and cognitive sciences, and related fields
3 editions published in 2007 in English and held by 6 WorldCat member libraries worldwide
The utility maximization paradigm forms the basis of many economic, psychological, cognitive and behavioral models. Since it was first devised in the eighteenth century, numerous examples have revealed the deficiencies of the concept. This book makes a contribution to overcome those deficiencies by taking into account insensitivity of measurement threshold and context of choice. It covers classic theory as a special, contextfree case and gives a systematic overview of new models of utility maximization within a contextdependent threshold as well as related preference and choice models. The second edition has been updated to include the most recent developments and a new chapter on classic and new results for infinite sets. The presented models will be helpful to scientists in economics, decision making theory, social choice theory, behavioral and cognitive sciences, and related fields
PROBLEMES DE TRANSVERSALITE DANS LES HYPERGRAPHES, LES ENSEMBLES ORDONNES ET EN THEORIE DE LA DECISION COLLECTIVE by
Bernard Monjardet(
Book
)
2 editions published in 1974 in French and held by 5 WorldCat member libraries worldwide
CETTE THESE PORTE D'ABORD SUR LES FAMILLES AUTOTRANSVERSALES. AU CHAPITRE I, ON EN DONNE DES CARACTERISATIONS ENSEMBLISTES, DANS LE LANGAGE DE LA THEORIE DES HYPERGRAPHES; AU CHAPITRE IV, ON OBTIENT UNE CARACTERISATION ALGEBRIQUE DANS LE TREILLIS DISTRIBUTIF LIBRE PERMETTANT D'EN CONSTRUIRE DES CLASSES INFINIES; AU CHAPITRE V, ON UTILISE CES FAMILLES POUR DEVELOPPER UNE THEORIE DE L'AGREGATION DES TOURNOIS. LE PASSAGE DES FAMILLES AUTOTRANSVERSABLES AUX ELEMENTS IPSODUAUX DU TREILLIS DISTRIBUTIF LIBRE N'EST QU'UN CAS PARTICULIER DU PASSAGE D'UN ENSEMBLE ORDONNE A UN TREILLIS DISTRIBUTIF; CETTE REPRESENTATION EST ETUDIEE EN DETAIL AU CHAPITRE III. LE CHAPITRE II TRAITE D'AUTRES QUESTIONS DE TRANSVERSABILITE DANS LES ENSEMBLES ORDONNES ET ETUDIE CERTAINES CLASSES D'ORDONNES TELS QUE LES ORDONNES DE SPERNER
2 editions published in 1974 in French and held by 5 WorldCat member libraries worldwide
CETTE THESE PORTE D'ABORD SUR LES FAMILLES AUTOTRANSVERSALES. AU CHAPITRE I, ON EN DONNE DES CARACTERISATIONS ENSEMBLISTES, DANS LE LANGAGE DE LA THEORIE DES HYPERGRAPHES; AU CHAPITRE IV, ON OBTIENT UNE CARACTERISATION ALGEBRIQUE DANS LE TREILLIS DISTRIBUTIF LIBRE PERMETTANT D'EN CONSTRUIRE DES CLASSES INFINIES; AU CHAPITRE V, ON UTILISE CES FAMILLES POUR DEVELOPPER UNE THEORIE DE L'AGREGATION DES TOURNOIS. LE PASSAGE DES FAMILLES AUTOTRANSVERSABLES AUX ELEMENTS IPSODUAUX DU TREILLIS DISTRIBUTIF LIBRE N'EST QU'UN CAS PARTICULIER DU PASSAGE D'UN ENSEMBLE ORDONNE A UN TREILLIS DISTRIBUTIF; CETTE REPRESENTATION EST ETUDIEE EN DETAIL AU CHAPITRE III. LE CHAPITRE II TRAITE D'AUTRES QUESTIONS DE TRANSVERSABILITE DANS LES ENSEMBLES ORDONNES ET ETUDIE CERTAINES CLASSES D'ORDONNES TELS QUE LES ORDONNES DE SPERNER
The lattices of closure systems, closure operators, and implicational systems on a finite set : a survey by
Nathalie Caspard(
Book
)
3 editions published in 2000 in English and held by 4 WorldCat member libraries worldwide
Abstract: "Closure systems (i.e. families of subsets of a set S containing S and closed by set intersection) or, equivalently, closure operators and full implicational systems, appear in many fields in pure or applied mathematics and computer science. We present a survey of properties of the lattice of closure systems on a finite set S, with proofs of the more significant results. In particular, we show that this lattice is atomistic and lower bounded and that there exists a canonical basis allowing to represent any closure system by 'implicational' closure systems. Since the lattices of closure operators and full implicational systems are antiisomorphic with the lattice of closure systems, they have the dual properties."
3 editions published in 2000 in English and held by 4 WorldCat member libraries worldwide
Abstract: "Closure systems (i.e. families of subsets of a set S containing S and closed by set intersection) or, equivalently, closure operators and full implicational systems, appear in many fields in pure or applied mathematics and computer science. We present a survey of properties of the lattice of closure systems on a finite set S, with proofs of the more significant results. In particular, we show that this lattice is atomistic and lower bounded and that there exists a canonical basis allowing to represent any closure system by 'implicational' closure systems. Since the lattices of closure operators and full implicational systems are antiisomorphic with the lattice of closure systems, they have the dual properties."
On finite lattices generated by their doubly irreducible elements by
Bernard Monjardet(
Book
)
3 editions published in 1987 in German and English and held by 3 WorldCat member libraries worldwide
3 editions published in 1987 in German and English and held by 3 WorldCat member libraries worldwide
Analyse et agregation des preferences dans les sciences sociales, economiques et de gestion(
Book
)
1 edition published in 1981 in French and held by 3 WorldCat member libraries worldwide
1 edition published in 1981 in French and held by 3 WorldCat member libraries worldwide
Permutoèdre et choix social by
Célestin Chameni(
)
1 edition published in 1989 in French and held by 2 WorldCat member libraries worldwide
In the first part, we study the graph and the lattice permuto hedron. The results on the lattice permutohedron are obtained as a particular case of a general class of lattices : pseudocomplemented and complemented lattices. in the second part we explain a relation between the latticial structure of the permutohedron and the simple majority rule: simple majority rule can not fall into intransitivity when it's applied on a set of total orders which forms a subdis tributive lattice and a sub graph of the permuthohedron
1 edition published in 1989 in French and held by 2 WorldCat member libraries worldwide
In the first part, we study the graph and the lattice permuto hedron. The results on the lattice permutohedron are obtained as a particular case of a general class of lattices : pseudocomplemented and complemented lattices. in the second part we explain a relation between the latticial structure of the permutohedron and the simple majority rule: simple majority rule can not fall into intransitivity when it's applied on a set of total orders which forms a subdis tributive lattice and a sub graph of the permuthohedron
Parties finissantes. Jeux simples by
Bernard Monjardet(
Book
)
in French and held by 2 WorldCat member libraries worldwide
in French and held by 2 WorldCat member libraries worldwide
The duality between the antiexchange closure operators and the path independent choice operators on a finite set by
Bernard Monjardet(
Book
)
2 editions published between 1999 and 2000 in English and held by 2 WorldCat member libraries worldwide
2 editions published between 1999 and 2000 in English and held by 2 WorldCat member libraries worldwide
ETUDE STRUCTURELLE ET ALGORITHMIQUE DE CLASSES DE TREILLIS OBTENUS PAR DUPLICATIONS by
Nathalie Caspard(
Book
)
1 edition published in 1998 in French and held by 2 WorldCat member libraries worldwide
CETTE THESE PROPOSE UNE ETUDE STRUCTURELLE ET ALGORITHMIQUE DE CERTAINS TREILLIS FINIS, ARTICULEE AUTOUR DU CONCEPT DE DUPLICATION. CETTE OPERATION CONSTRUCTIVE (DAY, 1970) PERMET DE PASSER D'UN TREILLIS L A UN TREILLIS L' PLUS "GROS" EN DUPLIQUANT UN CONVEXE C DE L. NOUS ETUDIONS CETTE CONSTRUCTION ET DONNONS DEUX REPONSES AU PROBLEME DE LA CONSERVATION DE PROPRIETES LATTICIELLES PAR DUPLICATIONA TRAVERS LES CAS DE L'ATOMISTICITE ET DE L'EXISTENCE D'UNE FONCTION DE RANG. NOUS CARACTERISONS AU MOYEN DES RELATIONSFLECHE DEFINIES SUR LES ELEMENTS IRREDUCTIBLES D'UN TREILLIS LE FAIT QU'UN TREILLIS EST OBTENU A PARTIR D'UN AUTRE PAR LA DUPLICATION D'UN ENSEMBLE CONVEXE. NOUS OBTENONS UNE CARACTERISATION PAR LES CTABLEAUX DES TREILLIS DE LA CLASSE 1[C] (TREILLIS POUVANT ETRE OBTENUS A PARTIR DU TREILLIS A DEUX ELEMENTS PAR UNE SUITE FINIE DE DUPLICATIONS DE CONVEXES). NOUS DECRIVONS ALORS UN ALGORITHME DE RECONNAISSANCE DE CES TREILLIS, QUI RETOURNE UN CTABLEAU DU TREILLIS SI CELUICI EST DANS 1[C], ENFIN, NOUS APPLIQUONS NOS RESULTATS A CERTAINES SOUSCLASSES REMARQUABLES DE 1[C] (TREILLIS BORNES, DISTRIBUTIFS ...). LE TROISIEME CHAPITRE EST CONSACRE AU TREILLIS DES PERMUTATIONS DONT NOUS REDEMONTRONS LA SEMIDISTRIBUTIVITE, EN EXPLICITANT LA BIJECTION INDUITE PAR LA RELATION DOUBLEFLECHE ENTRE LES IRREDUCTIBLES DU TREILLIS. NOUS AMELIORONS ALORS CE RESULTAT EN PROUVANT QUE LE TREILLIS DES PERMUTATIONS EST BORNE ET EST DONC DANS LA CLASSE 1[C]. NOUS DEMONTRONS ENSUITE UN CERTAIN NOMBRE DE RESULTATS SUPPLEMENTAIRES SUR LES RELATIONSFLECHE ET SUR LES RELATIONS DE DEPENDANCE. DANS LE DERNIER CHAPITRE, NOUS ETUDIONS LE TREILLIS DES FAMILLES DE MOORE DONT NOUS DEMONTRONS APRES QUELQUES RESULTATS PRELIMINAIRES QU'IL EST BORNE INFERIEUREMENT ET EST DONC AUSSI DANS 1[C]. PUIS NOUS REDEMONTRONS CERTAINS RESULTATS CONNUS SUR LES BASES CANONIQUES DES FAMILLES DE MOORE AVANT DE PROPOSER UNE CARACTERISATION DE CES BASES PARTICULIERES
1 edition published in 1998 in French and held by 2 WorldCat member libraries worldwide
CETTE THESE PROPOSE UNE ETUDE STRUCTURELLE ET ALGORITHMIQUE DE CERTAINS TREILLIS FINIS, ARTICULEE AUTOUR DU CONCEPT DE DUPLICATION. CETTE OPERATION CONSTRUCTIVE (DAY, 1970) PERMET DE PASSER D'UN TREILLIS L A UN TREILLIS L' PLUS "GROS" EN DUPLIQUANT UN CONVEXE C DE L. NOUS ETUDIONS CETTE CONSTRUCTION ET DONNONS DEUX REPONSES AU PROBLEME DE LA CONSERVATION DE PROPRIETES LATTICIELLES PAR DUPLICATIONA TRAVERS LES CAS DE L'ATOMISTICITE ET DE L'EXISTENCE D'UNE FONCTION DE RANG. NOUS CARACTERISONS AU MOYEN DES RELATIONSFLECHE DEFINIES SUR LES ELEMENTS IRREDUCTIBLES D'UN TREILLIS LE FAIT QU'UN TREILLIS EST OBTENU A PARTIR D'UN AUTRE PAR LA DUPLICATION D'UN ENSEMBLE CONVEXE. NOUS OBTENONS UNE CARACTERISATION PAR LES CTABLEAUX DES TREILLIS DE LA CLASSE 1[C] (TREILLIS POUVANT ETRE OBTENUS A PARTIR DU TREILLIS A DEUX ELEMENTS PAR UNE SUITE FINIE DE DUPLICATIONS DE CONVEXES). NOUS DECRIVONS ALORS UN ALGORITHME DE RECONNAISSANCE DE CES TREILLIS, QUI RETOURNE UN CTABLEAU DU TREILLIS SI CELUICI EST DANS 1[C], ENFIN, NOUS APPLIQUONS NOS RESULTATS A CERTAINES SOUSCLASSES REMARQUABLES DE 1[C] (TREILLIS BORNES, DISTRIBUTIFS ...). LE TROISIEME CHAPITRE EST CONSACRE AU TREILLIS DES PERMUTATIONS DONT NOUS REDEMONTRONS LA SEMIDISTRIBUTIVITE, EN EXPLICITANT LA BIJECTION INDUITE PAR LA RELATION DOUBLEFLECHE ENTRE LES IRREDUCTIBLES DU TREILLIS. NOUS AMELIORONS ALORS CE RESULTAT EN PROUVANT QUE LE TREILLIS DES PERMUTATIONS EST BORNE ET EST DONC DANS LA CLASSE 1[C]. NOUS DEMONTRONS ENSUITE UN CERTAIN NOMBRE DE RESULTATS SUPPLEMENTAIRES SUR LES RELATIONSFLECHE ET SUR LES RELATIONS DE DEPENDANCE. DANS LE DERNIER CHAPITRE, NOUS ETUDIONS LE TREILLIS DES FAMILLES DE MOORE DONT NOUS DEMONTRONS APRES QUELQUES RESULTATS PRELIMINAIRES QU'IL EST BORNE INFERIEUREMENT ET EST DONC AUSSI DANS 1[C]. PUIS NOUS REDEMONTRONS CERTAINS RESULTATS CONNUS SUR LES BASES CANONIQUES DES FAMILLES DE MOORE AVANT DE PROPOSER UNE CARACTERISATION DE CES BASES PARTICULIERES
On a dependence relation in finite lattices by
Bernard Monjardet(
Book
)
1 edition published in 1995 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 1995 in English and held by 2 WorldCat member libraries worldwide
Finite orders and their minimal strict completion lattices by
Gabriela Hauser Bordalo(
)
1 edition published in 2003 in English and held by 1 WorldCat member library worldwide
1 edition published in 2003 in English and held by 1 WorldCat member library worldwide
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Aleskerov, F. T. (Faud Tagi ogly) Author
 Caspard, Nathalie Author
 Leclerc, Bruno Other Contributor
 Bouyssou, D. (Denis)
 Barbut, Marc Author
 Leclerc, Bruno Author
 Bouyssou, Denis
 SpringerLink (Online service)
 Aleskerov, Fuad T.
 Université PanthéonSorbonne (Paris) Degree grantor
Associated Subjects
Algebra Algebra, Abstract Choice (Psychology)Mathematical models Combinatorial analysis Computer science Computer scienceMathematics Consensus (Social sciences)Mathematical models Consumers' preferences Consumers' preferencesMathematical models Decision making Economic developmentMathematical models Economics Economics, Mathematical Finite groups Game theory Group decision makingMathematical models Knowledge representation (Information theory) Lattice theory Management science Mathematics Operations research Ordered algebraic structures Ordered sets Relational databases Social choiceMathematical models Utility theory