default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSylvain Béal
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j32]Sylvain Béal
, Stéphane Gonzalez, Philippe Solal, Peter Sudhölter:
Axiomatic characterizations of the core without consistency. Int. J. Game Theory 52(3): 687-701 (2023)- 2022
- [j31]Sylvain Béal, Sylvain Ferrières, Philippe Solal:
The priority value for cooperative games with a priority structure. Int. J. Game Theory 51(2): 431-450 (2022) - [j30]Sylvain Béal, Eric Rémila, Philippe Solal:
Allocation rules for cooperative games with restricted communication and a priori unions based on the Myerson value and the average tree solution. J. Comb. Optim. 43(4): 818-849 (2022) - 2021
- [j29]Sylvain Béal, André Casajus, Eric Rémila, Philippe Solal:
Cohesive efficiency in TU-games: axiomatizations of variants of the Shapley value, egalitarian values and their convex combinations. Ann. Oper. Res. 302(1): 23-47 (2021) - 2020
- [j28]Sylvain Béal, Issofa Moyouwou, Eric Rémila, Philippe Solal:
Cooperative games on intersection closed systems and the Shapley value. Math. Soc. Sci. 104: 15-22 (2020) - [j27]Sylvain Béal, Florian Navarro:
Necessary versus equal players in axiomatic studies. Oper. Res. Lett. 48(3): 385-391 (2020)
2010 – 2019
- 2019
- [j26]Encarnación Algaba, Sylvain Béal, Eric Rémila, Philippe Solal:
Harsanyi power solutions for cooperative games on voting structures. Int. J. Gen. Syst. 48(6): 575-602 (2019) - 2018
- [j25]Sylvain Béal, André Casajus, Frank Huettner:
Efficient extensions of communication values. Ann. Oper. Res. 264(1-2): 41-56 (2018) - [j24]Sylvain Béal, Sylvain Ferrières, Eric Rémila, Philippe Solal:
The proportional Shapley value and applications. Games Econ. Behav. 108: 93-112 (2018) - [j23]Sylvain Béal, Anna B. Khmelnitskaya, Philippe Solal:
Two-step values for games with two-level communication structure. J. Comb. Optim. 35(2): 563-587 (2018) - [j22]Sylvain Béal, Sylvain Ferrières, Eric Rémila, Philippe Solal:
Axiomatization of an allocation rule for ordered tree TU-games. Math. Soc. Sci. 93: 132-140 (2018) - 2017
- [j21]Sylvain Béal, Eric Rémila, Philippe Solal:
A strategic implementation of the sequential equal surplus division rule for digraph cooperative games. Ann. Oper. Res. 253(1): 43-59 (2017) - [j20]Sylvain Béal, Eric Rémila, Philippe Solal:
Discounted tree solutions. Discret. Appl. Math. 219: 1-17 (2017) - 2016
- [j19]Sylvain Béal, Eric Rémila, Philippe Solal:
Characterizations of Three Linear Values for TU Games by Associated Consistency: Simple Proofs Using the Jordan Normal Form. IGTR 18(1): 1650003:1-1650003:21 (2016) - [j18]Sylvain Béal, Sylvain Ferrières, Eric Rémila, Philippe Solal:
Axiomatic characterizations under players nullification. Math. Soc. Sci. 80: 47-57 (2016) - 2015
- [j17]Sylvain Béal, Eric Rémila, Philippe Solal:
A decomposition of the space of TU-games using addition and transfer invariance. Discret. Appl. Math. 184: 1-13 (2015) - [j16]Sylvain Béal, Eric Rémila, Philippe Solal:
Axioms of invariance for TU-games. Int. J. Game Theory 44(4): 891-902 (2015) - [j15]Sylvain Béal, Eric Rémila, Philippe Solal:
Preserving or removing special players: What keeps your payoff unchanged in TU-games? Math. Soc. Sci. 73: 23-31 (2015) - [j14]Sylvain Béal, Eric Rémila, Philippe Solal:
Decomposition of the space of TU-games, Strong transfer invariance and the Banzhaf value. Oper. Res. Lett. 43(2): 123-125 (2015) - [j13]Sylvain Béal, André Casajus, Frank Huettner:
Efficient extensions of the Myerson value. Soc. Choice Welf. 45(4): 819-827 (2015) - 2013
- [j12]Sylvain Béal, Eric Rémila, Philippe Solal:
An optimal bound to access the core in TU-games. Games Econ. Behav. 80: 1-9 (2013) - [j11]Sylvain Béal, Amandine Ghintran, Eric Rémila, Philippe Solal:
The River Sharing Problem: a Survey. IGTR 15(3) (2013) - [j10]Sylvain Béal, Eric Rémila, Philippe Solal:
Accessibility and stability of the coalition structure core. Math. Methods Oper. Res. 78(2): 187-202 (2013) - 2012
- [j9]Sylvain Béal, Aymeric Lardon, Eric Rémila, Philippe Solal:
The average tree solution for multi-choice forest games. Ann. Oper. Res. 196(1): 27-51 (2012) - [j8]Sylvain Béal, Eric Rémila, Philippe Solal:
On the number of blocks required to access the core. Discret. Appl. Math. 160(7-8): 925-932 (2012) - [j7]Sylvain Béal, Eric Rémila, Philippe Solal:
Compensations in the Shapley value and the compensation solutions for graph games. Int. J. Game Theory 41(1): 157-178 (2012) - [j6]Sylvain Béal, Eric Rémila, Philippe Solal:
Weighted component fairness for forest games. Math. Soc. Sci. 64(2): 144-151 (2012) - [c1]Sylvain Béal, Eric Rémila, Philippe Solal:
An Optimal Bound to Access the Core in TU-Games. SAGT 2012: 49-60 - 2011
- [j5]Richard Baron, Sylvain Béal, Eric Rémila, Philippe Solal:
Average tree solutions and the distribution of Harsanyi dividends. Int. J. Game Theory 40(2): 331-349 (2011) - 2010
- [j4]Sylvain Béal, Eric Rémila, Philippe Solal:
Rooted-tree solutions for tree games. Eur. J. Oper. Res. 203(2): 404-408 (2010) - [j3]Sylvain Béal, Subhadip Chakrabarti, Amandine Ghintran, Philippe Solal:
Partial Cooperative Equilibria: Existence and Characterization. Games 1(3): 338-356 (2010)
2000 – 2009
- 2008
- [j2]Sylvain Béal, Jacques Durieu, Philippe Solal:
Farsighted coalitional stability in TU-games. Math. Soc. Sci. 56(3): 303-313 (2008) - 2007
- [j1]Sylvain Béal, Nicolas Quérou:
Bounded rationality and repeated network formation. Math. Soc. Sci. 54(1): 71-89 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
