default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristian Trudeau
Person information
- affiliation: University of Windsor, Ontario, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j17]Ata Atay
, Christian Trudeau:
Queueing games with an endogenous number of machines. Games Econ. Behav. 144: 104-125 (2024)- 2023
- [j16]Christian Trudeau:
Minimum cost spanning tree problems as value sharing problems. Int. J. Game Theory 52(1): 253-272 (2023) - 2020
- [j15]Christian Trudeau, Juan J. Vidal-Puga:
Clique games: A family of games with coincidence between the nucleolus and the Shapley value. Math. Soc. Sci. 103: 8-14 (2020) - 2019
- [j14]Eric Bahel, Christian Trudeau:
Stability and fairness in the job scheduling problem. Games Econ. Behav. 117: 1-14 (2019) - 2018
- [j13]Christian Trudeau:
From the bankruptcy problem and its Concede-and-Divide solution to the assignment problem and its Fair Division solution. Games Econ. Behav. 108: 225-238 (2018) - [j12]Eric Bahel, Christian Trudeau:
Consistency requirements and pattern methods in cost sharing problems with technological cooperation. Int. J. Game Theory 47(3): 737-765 (2018) - 2017
- [j11]Christian Trudeau, Juan J. Vidal-Puga:
On the set of extreme core allocations for minimal cost spanning tree problems. J. Econ. Theory 169: 425-452 (2017) - [j10]Eric Bahel, Christian Trudeau:
Minimum incoming cost rules for arborescences. Soc. Choice Welf. 49(2): 287-314 (2017) - 2014
- [j9]Christian Trudeau:
Minimum cost spanning tree problems with indifferent agents. Games Econ. Behav. 84: 137-151 (2014) - [j8]Christian Trudeau:
Linking the Kar and folk solutions through a problem separation property. Int. J. Game Theory 43(4): 845-870 (2014) - [j7]Christian Trudeau:
Characterizations of the cycle-complete and folk solutions for minimum cost spanning tree problems. Soc. Choice Welf. 42(4): 941-957 (2014) - [j6]Eric Bahel, Christian Trudeau:
Shapley-Shubik methods in cost sharing problems with technological cooperation. Soc. Choice Welf. 43(2): 261-285 (2014) - 2013
- [j5]Christian Trudeau:
Characterizations of the Kar and Folk solutions for Minimum Cost Spanning Tree Problems. IGTR 15(2) (2013) - [j4]Eric Bahel, Christian Trudeau:
A discrete cost sharing model with technological cooperation. Int. J. Game Theory 42(2): 439-460 (2013) - 2012
- [j3]Christian Trudeau:
A new stable and more responsive cost sharing solution for minimum cost spanning tree problems. Games Econ. Behav. 75(1): 402-412 (2012) - 2009
- [j2]Christian Trudeau:
Cost sharing with multiple technologies. Games Econ. Behav. 67(2): 695-707 (2009) - [j1]Christian Trudeau:
Network flow problems and permutationally concave games. Math. Soc. Sci. 58(1): 121-131 (2009)
Informal and Other Publications
- 2024
- [i2]Ata Atay, Christian Trudeau:
Optimistic and pessimistic approaches for cooperative games. CoRR abs/2403.01442 (2024) - 2022
- [i1]Ata Atay, Christian Trudeau:
Queueing games with an endogenous number of machines. CoRR abs/2207.07190 (2022)
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-08-05 21:14 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:
