Access Statistics for Sylvain Béal

Author contact details at EconPapers.

Working Paper File Downloads Abstract Views
Last month 3 months 12 months Total Last month 3 months 12 months Total
A Class of Solidarity Allocation Rules for TU-games 0 0 0 30 0 1 1 51
A Class of Solidarity Allocation Rules for TU-games 0 0 0 0 0 0 1 33
A Core-Partition Ranking Solution to Coalitional Ranking Problems 0 0 0 0 3 3 4 5
A Core-partition solution for coalitional rankings with a variable population domain 0 0 1 16 0 1 6 36
A Decomposition of the Space of TU-games Using Addition and Transfer Invariance 0 0 0 17 0 1 1 87
A Decomposition of the Space of TU-games Using Addition and Transfer Invariance 0 0 0 0 0 1 2 38
A characterization of the family of Weighted priority values 1 2 2 15 1 3 4 29
A characterization of the family of Weighted priority values 0 0 0 0 1 2 2 2
A class of solidarity allocation rules for TU-games 0 0 0 7 0 1 3 32
A strategic implementation of the sequential equal surplus division rule for digraph cooperative games 0 0 0 18 0 0 2 24
A strategic implementation of the sequential equal surplus division rule for digraph cooperative games 0 0 0 0 0 0 1 24
A strategic implementation of the sequential equal surplus division rule for digraph cooperative games 0 0 0 14 0 1 3 43
Accessibility and stability of the coalition structure core 0 0 0 0 1 2 2 23
Allocation rules for cooperative games with restricted communication and a priori unions based on the Myerson value and the average tree solution 0 0 0 0 0 1 3 8
Allocation rules for cooperative games with restricted communication and a priori unions based on the Myerson value and the average tree solution 0 0 0 0 0 0 3 4
Allocation rules for museum pass programs 0 0 0 34 1 2 3 94
An Optimal Bound to Access the Core in TU-Games 0 0 0 0 0 1 1 35
An axiomatization of the iterated h-index and applications to sport rankings 0 0 0 28 1 1 1 53
An axiomatization of the iterated h-index and applications to sport rankings 0 0 1 42 1 1 6 93
An optimal bound to acces the core of TU-games 0 0 0 0 0 1 2 24
An optimal bound to access the core in TU-games 0 0 0 0 0 0 2 31
An optimal bound to access the core in TU-games 0 0 0 31 1 3 3 84
An optimal bound to access the core in TU-games 0 0 0 0 0 1 2 33
An optimal bound to access the core in TU-games 0 0 0 0 0 2 4 36
Average Tree Solutions and the Distribution of Harsanyi Dividends 0 0 0 0 0 1 1 44
Average Tree Solutions and the Distribution of Harsanyi Dividends 0 0 0 0 0 1 1 23
Average Tree Solutions and the Distribution of Harsanyi Dividends 0 0 0 0 0 0 2 34
Average tree solution for graph games 0 0 0 0 0 1 2 34
Average tree solutions and the distribution of Harsanyi dividends 0 0 0 33 0 1 1 95
Average tree solutions for graph games 0 0 0 0 0 1 2 26
Average tree solutions for graph games 0 0 0 54 1 2 2 299
Axiomatic and bargaining foundation of an allocation rule for ordered tree TU-games 0 0 0 0 0 1 3 36
Axiomatic and bargaining foundation of an allocation rule for ordered tree TU-games 0 0 0 0 0 1 3 26
Axiomatic and bargaining foundations of an allocation rule for ordered tree TU-games 0 0 0 26 0 1 2 57
Axiomatic characterizations of the core without consistency 0 0 0 14 0 0 1 21
Axiomatic characterizations of the core without consistency 0 0 0 0 0 0 0 1
Axiomatic characterizations of the core without consistency 0 0 0 9 0 1 4 24
Axiomatic characterizations of the core without consistency 0 0 0 0 0 2 2 2
Axiomatic characterizations of the family of Weighted priority values 0 0 0 0 1 1 3 9
Axiomatic characterizations under players nullification 0 0 0 0 0 0 1 38
Axiomatic characterizations under players nullification 0 0 0 8 0 1 1 30
Axiomatic characterizations under players nullification 0 0 0 25 0 1 1 62
Axiomatization and implementation of a class of solidarity values for TU-games 0 0 0 0 0 1 2 36
Axiomatization of an allocation rule for ordered tree TU-games 0 0 0 0 1 1 1 41
Axioms of Invariance for TU-games 0 0 1 52 0 1 2 153
Axioms of Invariance for TU-games 0 0 0 0 0 1 2 37
Axioms of invariance for TU-games 0 0 0 25 0 1 1 71
Balanced collective contributions, the equal allocation of non-separable costs and application to data sharing games 0 0 0 1 0 1 3 29
Balanced collective contributions, the equal allocation of non-separable costs and application to data sharing games 1 1 1 36 1 2 4 66
Bounded Rationality and Repeated Network Formation 0 0 0 1 0 1 1 22
Bounded Rationality and Repeated Network Formation 0 0 0 68 0 0 0 270
Bounded rationality and repeated network formation 0 0 0 0 0 1 1 29
Characterization of the Average Tree solution and its kernel 0 0 0 8 0 1 2 44
Characterization of the Average Tree solution and its kernel 0 0 0 0 0 1 1 29
Characterization of the Average Tree solution and its kernel 0 0 0 0 1 2 2 23
Characterization of the Average Tree solution and its kernel 0 0 0 0 0 1 2 27
Characterizations of Weighted and Equal Division Values 0 0 0 0 0 1 3 44
Characterizations of three linear values for TU games by associated consistency: simple proofs using the Jordan normal form 0 0 0 0 0 1 3 29
Characterizations of three linear values for TU games by associated consistency: simple proofs using the Jordan normal form 0 0 0 0 0 1 2 25
Characterizations of three linear values for TU games by associated consistency: simple proofs using the Jordan normal form 0 0 0 0 0 1 2 29
Characterizations of three linear values for TU games by associated consistency: simple proofs using the Jordan normal form 0 0 0 7 0 1 2 18
Characterizations of three linear values for TU games by associated consistency: simple proofs using the Jordan normal form 0 0 0 19 0 1 2 59
Coalitional desirability and the equal division value 0 0 0 31 1 2 3 60
Coalitional desirability and the equal division value 0 0 0 0 2 2 4 40
Cohesive efficiency in TU-games: Two extensions of the Shapley value 0 0 1 24 1 2 3 88
Cohesive efficiency in TU-games: axiomatizations of variants of the Shapley value, egalitarian values and their convex combinations 0 0 0 0 1 2 5 5
Comparable Axiomatizations of Two Allocation Rules for Cooperative Games with Transferable Utility and their Subclass of Data Games 0 0 0 0 0 1 1 38
Compensations in the Shapley Value and the Compensation Solutions for Graph Games 0 0 0 0 0 0 1 23
Compensations in the Shapley value and the compensation solutions for graph games 0 0 0 0 0 1 2 28
Compensations in the Shapley value and the compensation solutions for graph games 0 0 0 43 1 2 3 124
Compensations in the Shapley value and the compensation solutions for graph games 0 0 0 0 0 1 2 28
Compensations in the Shapley value and the compensation solutions for graph games 0 0 0 0 0 1 3 29
Cooperative games on intersection closed systems and the Shapley value 0 0 0 0 0 1 2 17
Cooperative games on intersection closed systems and the Shapley value 1 1 1 17 1 2 2 40
Cooperative games with diversity constraints 0 0 4 4 2 3 8 9
Cooperative games with diversity constraints 1 2 2 2 1 2 4 4
Decomposition of the space of TU-games, Strong Transfer Invariance and the Banzhaf value 0 0 0 0 1 2 3 28
Decomposition of the space of TU-games, Strong Transfer Invariance and the Banzhaf value 0 0 0 0 0 2 2 15
Decomposition of the space of TU-games, Strong Transfer Invariance and the Banzhaf value 0 0 0 44 0 2 3 48
Discounted Tree Solutions 0 0 0 0 0 1 2 25
Discounted Tree Solutions 0 0 0 8 0 1 2 26
Discounted Tree Solutions 0 0 0 0 0 1 2 29
Discounted Tree Solutions 0 0 0 17 1 2 2 63
Discounted Tree Solutions 0 0 0 0 0 2 3 26
Early contributors, cooperation and fair rewards in crowdfunding 0 0 0 0 0 0 2 5
Early contributors, cooperation and fair rewards in crowdfunding 0 0 2 25 1 4 20 80
Efficient extension of the Myerson value 0 0 0 13 0 1 1 15
Efficient extensions of communication values 0 0 0 14 1 3 3 35
Efficient extensions of communication values 0 0 0 12 0 1 3 26
Efficient extensions of the Myerson value 0 0 0 32 0 1 2 64
Examination design: an axiomatic approach 0 0 3 11 0 2 5 46
Fairness and Fairness for Neighbors: The Difference between the Myerson Value and Component-Wise Egalitarian Solutions 0 0 0 0 2 3 3 32
Fairness and fairness for neighbors: the difference between the Myerson value and component-wise egalitarian solutions 0 0 0 13 0 1 1 62
Farsighted Coalitional Stability in TU-Games 0 0 0 0 0 1 1 32
Farsighted Coalitional Stability in TU-Games 0 0 0 0 0 1 2 33
Farsighted Coalitional Stability in TU-Games 0 0 0 0 0 1 2 32
Farsighted Coalitional Stability in TU-games 0 0 0 1 0 1 2 42
Farsighted Coalitional Stability in TU-games 0 0 0 59 0 1 1 350
Farsighted coalitional stability in TU-games 0 0 0 0 0 1 1 3
Farsighted coalitional stability in TU-games 0 0 1 2 0 1 2 48
Freezeout, Compensation Rules and Voting Equilibria 0 0 0 27 1 2 3 106
Freezeout, Compensation Rules, and Voting Equilibria 0 0 0 0 0 1 1 26
GAMES WITH IDENTICAL SHAPLEY VALUES 0 0 0 64 0 2 2 92
Games with Identical Shapley Values 0 0 0 0 0 0 1 1
Harsanyi Power Solutions for Cooperative Games on Voting Structures 0 0 0 0 0 2 4 27
Harsanyi power solutions for cooperative games on voting structures 0 0 0 21 0 2 3 70
Harsanyi power solutions for cooperative games on voting structures 0 0 0 0 0 2 2 10
Inconsistent weighting in weighted voting games 0 0 0 0 0 0 2 2
Inconsistent weighting in weighted voting games 0 0 0 0 0 0 0 0
Inconsistent weighting in weighted voting games 0 0 0 26 0 1 1 67
Informational Advantage and Influence of Communicating Central Banks 0 0 0 27 0 2 5 104
La mise en place de la législation européenne REACH: Une analyse des effets anticoncurrentiels 0 0 0 0 0 1 3 48
Les effets d'une réglementation sur la concurrence et l'innovation: première analyse de la réglementation européenne REACH 0 0 0 0 0 1 1 37
Les informations exigées par la législation REACH: analyse du partage des coûts 0 0 0 0 0 1 2 23
Lexicographic solutions for coalitional rankings based on individual and collective performances 0 0 0 0 0 0 2 2
Lexicographic solutions for coalitional rankings based on individual and collective performances 0 0 0 0 0 0 1 1
Lexicographic solutions for coalitional rankings based on individual and collective performances 0 0 1 3 0 1 3 20
Multiwinner elections with diversity constraints on individual preferences 0 0 2 3 0 0 15 18
Multiwinner elections with diversity constraints on individual preferences 0 1 1 1 0 1 9 10
Necessary versus equal players in axiomatic studies 0 0 0 1 0 1 3 6
Necessary versus equal players in axiomatic studies 0 0 0 12 0 1 3 43
New axiomatisations of the Diversity Owen and Shapley values 0 0 0 0 0 1 2 2
New axiomatizations of the Diversity Owen and Shapley values 0 0 3 3 0 4 5 5
On compensation schemes for data sharing within the European REACH legislation 0 0 0 1 0 0 1 35
On compensation schemes for data sharing within the european REACH legislation 0 0 0 31 0 2 3 99
On the Number of Blocks Required to Access the Core 0 0 0 0 0 1 2 43
On the number of blocks required to access the coalition structure core 0 0 0 19 0 1 2 54
On the number of blocks required to access the core 0 0 0 28 0 1 1 136
On the number of blocks required to access the core 0 0 0 0 0 1 2 33
PERCEPTRON VERSUS AUTOMATON∗ 0 0 0 18 0 0 1 118
Partial Cooperative Equilibria: Existence and Characterization 0 0 0 0 1 2 2 29
Perceptron versus Automaton 0 0 0 0 1 3 3 16
Perceptron versus Automaton 0 0 0 0 0 1 1 19
Perceptron versus Automaton in the Finitely Repeated Prisoner's Dilemma 0 0 0 0 0 1 2 18
Perceptron versus automaton 0 0 0 2 0 0 0 27
Preserving or removing special players: What keeps your payoff unchanged in TU-games? 0 0 0 1 0 2 14 55
Preserving or removing special players: what keeps your payoff unchanged in TU-games? 0 0 0 23 1 2 5 129
REACH legislation 0 0 0 0 0 1 3 67
Rationalité limitée et jeux de machines 0 0 0 0 1 1 3 19
Relationship between labeled network games and museum pass games 0 0 0 14 1 1 2 53
Relationship between labeled network games and other cooperative games arising from attributes situations 0 0 0 0 0 1 3 3
Rooted-tree Solutions for Tree Games 0 0 0 0 0 1 1 37
Règles d'allocation pour les programmes de pass culturel 0 0 0 0 0 0 0 0
Règles d'allocation pour les programmes de pass culturels 0 0 0 0 0 2 2 26
Sharing the cost of cleaning up non-point source pollution 0 0 1 1 0 0 7 7
Sharing the cost of cleaning up non-point source pollution 0 0 0 0 1 1 1 1
Sharing the cost of hazardous transportation networks and the Priority Shapley value 0 0 0 0 0 0 1 1
Sharing the cost of hazardous transportation networks and the Priority Shapley value 0 0 0 5 0 0 2 13
Solidarity within a Fixed Community 0 0 0 0 0 1 1 34
Taxing congestion of the space commons 0 1 1 1 0 1 2 2
The Average Tree Solution for Multi-Choice Forest Games 0 0 0 0 0 1 1 42
The Average Tree Solution for Multi-choice Forest Games 0 0 0 31 0 1 1 99
The Average Tree Solution for Multi-choice Forest Games 0 0 0 0 0 1 1 35
The Priority Value for Cooperative Games with a Priority Structure 0 0 0 0 1 1 1 1
The Priority Value for Cooperative Games with a Priority Structure 0 0 1 50 2 3 7 125
The River Sharing Problem: a Survey 0 0 0 0 0 3 7 104
The Sequential Equal Surplus Division for Rooted Forest Games and an Application to Sharing a River with Bifurcations 0 0 0 25 0 0 2 60
The Sequential Equal Surplus Division for Sharing International Rivers with Bifurcations 0 0 0 58 0 3 3 182
The neighborhood value for cooperative graph games 0 0 0 0 0 2 4 4
The neighborhood value for cooperative graph games 0 0 0 0 0 1 1 1
The neighborhood value for cooperative graph games 0 0 11 11 0 1 13 13
The priority value for cooperative games with a priority structure 0 0 0 0 0 1 2 8
The proportional Shapley value and an application 0 0 0 9 0 1 2 31
The proportional Shapley value and an application 0 0 0 40 0 0 1 104
The proportional Shapley value and applications 0 0 0 1 0 1 1 33
The proportional Shapley value and applications 0 0 0 0 0 1 1 24
The sequential equal surplus division for rooted forest games and an application to sharing a river with bifurcations 0 0 0 20 1 2 5 38
The sequential equal surplus division for rooted forest games and an application to sharing a river with bifurcations 0 0 0 0 0 1 3 63
The sequential equal surplus division for sharing a river 0 0 0 29 0 1 1 84
The sequential surplus division for sharing a river with bifurcations 0 0 0 0 0 1 2 25
Théorie des jeux coopératifs et non-coopératifs 0 0 0 0 0 2 3 3
Two-step values for games with two-level communication structure 0 0 0 0 0 2 3 31
Two-step values for games with two-level communication structure 0 0 0 16 0 1 2 50
Veto players, the kernel of the Shapley value and its characterization 0 0 0 2 0 1 1 17
Veto players, the kernel of the Shapley value and its characterization 0 1 1 21 1 3 4 41
Weighted Component Fairness for Forest Games 0 0 0 19 0 1 1 88
Weighted component fairness for forest games 0 0 0 0 0 1 1 25
Total Working Papers 4 9 42 1,674 43 214 459 7,687
1 registered items for which data could not be found

Journal Article File Downloads Abstract Views
Last month 3 months 12 months Total Last month 3 months 12 months Total
A Core-Partition Ranking Solution to Coalitional Ranking Problems 0 0 2 4 2 2 5 7
A strategic implementation of the sequential equal surplus division rule for digraph cooperative games 0 0 0 3 1 2 5 22
Accessibility and stability of the coalition structure core 0 0 0 3 1 2 3 46
Allocation rules for cooperative games with restricted communication and a priori unions based on the Myerson value and the average tree solution 0 0 0 1 1 2 7 9
An optimal bound to access the core in TU-games 0 0 0 16 0 1 2 80
Average tree solutions and the distribution of Harsanyi dividends 0 0 0 6 0 1 1 69
Axiomatic characterizations of the core without consistency 0 0 0 0 1 1 2 3
Axiomatic characterizations of the family of Weighted priority values 0 1 1 1 0 3 5 5
Axiomatic characterizations under players nullification 0 0 0 2 0 1 3 44
Axiomatization and implementation of a class of solidarity values for TU-games 0 1 2 15 1 3 6 84
Axiomatization of an allocation rule for ordered tree TU-games 0 0 0 1 0 1 1 30
Axioms of invariance for TU-games 0 0 0 1 1 3 4 53
Bounded rationality and repeated network formation 0 0 0 12 0 1 2 81
Characterization of the Average Tree solution and its kernel 0 0 0 5 0 1 2 36
Characterizations of Three Linear Values for TU Games by Associated Consistency: Simple Proofs Using the Jordan Normal Form 0 0 0 3 0 1 2 34
Characterizations of weighted and equal division values 0 0 0 2 1 1 1 43
Coalitional desirability and the equal division value 0 0 0 2 1 2 3 39
Cohesive efficiency in TU-games: axiomatizations of variants of the Shapley value, egalitarian values and their convex combinations 0 0 0 4 0 1 3 19
Comparable Axiomatizations of Two Allocation Rules for Cooperative Games with Transferable Utility and Their Subclass of Data Games 0 0 0 3 0 1 1 28
Compensations in the Shapley value and the compensation solutions for graph games 0 0 0 8 0 1 2 73
Comportements adaptatifs sans croyances 0 0 0 1 1 2 3 29
Cooperative games on intersection closed systems and the Shapley value 0 0 0 3 0 1 1 14
Efficient extensions of communication values 0 0 1 3 0 1 2 33
Efficient extensions of the Myerson value 0 0 0 3 1 4 5 33
Fairness and fairness for neighbors: The difference between the Myerson value and component-wise egalitarian solutions 0 0 1 5 0 1 4 58
Farsighted coalitional stability in TU-games 0 0 1 31 0 0 2 132
Freezeout, compensation rules, and voting equilibria 0 0 0 2 0 1 1 44
Inconsistent weighting in weighted voting games 0 0 0 0 0 1 1 10
Introduction 0 0 0 0 0 0 2 3
La mise en place de la législation européenne REACH. Une analyse des effets anticoncurrentiels 0 0 0 9 0 2 3 88
Les effets d'une réglementation sur la concurrence et l'innovation: première analyse de la réglementation européenne REACH 0 0 0 1 1 1 2 39
Les effets d’une réglementation sur la concurrence et l’innovation: première analyse de la réglementation européenne REACH 0 0 0 2 1 2 2 50
Les informations exigées par la législation REACH: Analyse du partage des coûts 0 0 0 9 0 1 2 70
Lexicographic solutions for coalitional rankings based on individual and collective performances 0 0 0 1 0 1 2 4
On compensation schemes for data sharing within the European REACH legislation 0 0 0 3 0 2 2 57
On the existence of efficient and fair extensions of communication values for connected graphs 0 1 1 2 1 3 4 30
Partial Cooperative Equilibria: Existence and Characterization 0 0 0 22 0 2 2 123
Perceptron versus automaton in the finitely repeated prisoner’s dilemma 0 0 0 6 1 2 3 47
Preserving or removing special players: What keeps your payoff unchanged in TU-games? 0 0 0 1 0 1 3 52
Rationalité limitée et jeux de machines 0 0 0 5 1 2 2 53
Relationship between labeled network games and other cooperative games arising from attributes situations 0 0 0 3 1 3 3 30
Rooted-tree solutions for tree games 0 0 0 14 0 1 3 101
Règles d'allocation pour les programmes de pass culturel. Allocation rules for museum pass programs 0 0 0 5 0 1 1 44
Solidarity within a fixed community 0 0 0 3 1 2 2 43
THE RIVER SHARING PROBLEM: A SURVEY 1 4 8 38 2 5 16 106
The average tree solution for multi-choice forest games 0 0 0 5 1 2 2 46
The priority value for cooperative games with a priority structure 0 0 1 2 2 3 5 14
The proportional Shapley value and applications 0 1 2 15 2 4 7 68
The sequential equal surplus division for rooted forest games and an application to sharing a river with bifurcations 0 0 0 4 0 1 3 45
Two-step values for games with two-level communication structure 0 0 0 0 0 1 2 12
Weighted component fairness for forest games 0 0 0 5 0 1 1 56
Total Journal Articles 1 8 20 295 26 85 153 2,339

logo

LogEc Home

Top Working Papers
Top Journal Articles
Top Books
Top Chapters
Top Software Items

Top Authors

Top Working Paper series and Journals

About LogEc

Authors with papers registered in the RePEc Author Service.

Register yourself as an author or register more papers in the RePEc Author Service.

Authors with no registered papers

RePEc
LogEc provides access and usage for services based on the RePEc data set.

Örebro UniversityLogEc is hosted by the Örebro University School of Business.

Questions or comments? Please see our explanation of how the statistics are collected or e-mail

Statistics updated 2025-03-03