default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBertrand Tchantcho
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Joseph Siani
, Bertrand Tchantcho, Bill Proces Tsague:
Axiomatization of some power indices in voting games with abstention. Soc. Choice Welf. 62(4): 761-783 (2024)- 2023
- [j14]Joseph Siani, Narcisse Tedjeugang, Bertrand Tchantcho:
Influence relation in two-output multichoice voting games. Games Econ. Behav. 142: 879-895 (2023) - 2022
- [c2]Brice Mayag, Bertrand Tchantcho:
The d-Interaction Index in MCDA. IPMU (2) 2022: 210-220 - 2021
- [j13]Roland Pongou, Bertrand Tchantcho:
Round-robin political tournaments: Abstention, truthful equilibria, and effective power. Games Econ. Behav. 130: 331-351 (2021) - 2020
- [c1]Brice Mayag, Bertrand Tchantcho:
The Necessary and Possible Importance Relation Among Criteria in a 2-Additive Choquet Integral Model. IPMU (2) 2020: 496-509
2010 – 2019
- 2019
- [j12]Josep Freixas, Bertrand Tchantcho, Bill Proces Tsague:
A parameterization for a class of complete games with abstention. Discret. Appl. Math. 255: 21-39 (2019) - [j11]Joseph Armel Momo Kenfack, Bertrand Tchantcho, Bill Proces Tsague:
On the ordinal equivalence of the Jonhston, Banzhaf and Shapley-Shubik power indices for voting games with abstention. Int. J. Game Theory 48(2): 647-671 (2019) - 2017
- [j10]Roland Pongou, Bertrand Tchantcho, Narcisse Tedjeugang:
Properties of ladder tournaments. Eur. J. Oper. Res. 263(1): 203-213 (2017) - [j9]Sébastien Courtin, Zéphirin Nganmeni, Bertrand Tchantcho:
Dichotomous multi-type games with a coalition structure. Math. Soc. Sci. 86: 9-17 (2017) - [j8]Mathieu Martin, Zéphirin Nganmeni, Bertrand Tchantcho:
The Owen and Shapley spatial power indices: A comparison and a generalization. Math. Soc. Sci. 89: 10-19 (2017) - 2014
- [j7]Josep Freixas, Bertrand Tchantcho, Narcisse Tedjeugang:
Voting games with abstention: Linking completeness and weightedness. Decis. Support Syst. 57: 172-177 (2014) - [j6]Josep Freixas, Bertrand Tchantcho, Narcisse Tedjeugang:
Achievable hierarchies in voting games with abstention. Eur. J. Oper. Res. 236(1): 254-260 (2014) - [j5]Joseph Armel Momo Kenfack, Bertrand Tchantcho:
On the non-emptiness of the one-core and the bargaining set of committee games. Oper. Res. Lett. 42(2): 113-118 (2014) - 2012
- [j4]Lawrence Diffo Lambo, Bertrand Tchantcho, Joël Moulen:
Comparing influence theories in voting games under locally generated measures of dissatisfaction. Int. J. Game Theory 41(3): 719-731 (2012) - 2010
- [j3]Bertrand Tchantcho, Lawrence Diffo Lambo, Roland Pongou, Joël Moulen:
On the equilibrium of voting games with abstention and several levels of approval. Soc. Choice Welf. 34(3): 379-396 (2010)
2000 – 2009
- 2009
- [j2]Lawrence Diffo Lambo, Bertrand Tchantcho, Joël Moulen:
A core of voting games with improved foresight. Math. Soc. Sci. 58(2): 214-225 (2009) - 2008
- [j1]Bertrand Tchantcho, Lawrence Diffo Lambo, Roland Pongou, Bertrand Mbama Engoulou:
Voters' power in voting games with abstention: Influence relation and ordinal equivalence of power theories. Games Econ. Behav. 64(1): 335-350 (2008)
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-06-19 21:48 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:
