default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMikel Álvarez-Mozos
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Mikel Álvarez-Mozos
, Lars Ehlers:
Externalities and the (pre)nucleolus in cooperative games. Math. Soc. Sci. 128: 10-15 (2024)- 2021
- [j14]José María Alonso-Meijide, Mikel Álvarez-Mozos, M. Gloria Fiestras-Janeiro, Andrés Jiménez-Losada:
Marginality and convexity in partition function form games. Math. Methods Oper. Res. 94(1): 99-121 (2021)
2010 – 2019
- 2019
- [j13]José María Alonso-Meijide, Mikel Álvarez-Mozos, M. Gloria Fiestras-Janeiro, Andrés Jiménez-Losada:
Complete null agent for games with externalities. Expert Syst. Appl. 135: 1-11 (2019) - 2018
- [j12]Oriol Tejada, Mikel Álvarez-Mozos:
Graphs and (levels of) cooperation in games: Two ways how to allocate the surplus. Math. Soc. Sci. 93: 114-122 (2018) - 2017
- [j11]Mikel Álvarez-Mozos, José María Alonso-Meijide, M. Gloria Fiestras-Janeiro:
On the externality-free Shapley-Shubik index. Games Econ. Behav. 105: 148-154 (2017) - [j10]José María Alonso-Meijide, Mikel Álvarez-Mozos, M. Gloria Fiestras-Janeiro, Andrés Jiménez-Losada:
Some structural properties of a lattice of embedded coalitions. Int. J. Gen. Syst. 46(2): 123-143 (2017) - [j9]Mikel Álvarez-Mozos, René van den Brink, Gerard van der Laan, Oriol Tejada:
From hierarchies to levels: new solutions for games with hierarchical structure. Int. J. Game Theory 46(4): 1089-1113 (2017) - 2016
- [j8]M. Josune Albizuri, Mikel Álvarez-Mozos:
The \(a\) -serial cost sharing rule. Central Eur. J. Oper. Res. 24(1): 73-86 (2016) - 2015
- [j7]José M. Alonso-Meijide, Mikel Álvarez-Mozos, M. Gloria Fiestras-Janeiro:
The least square nucleolus is a normalized Banzhaf value. Optim. Lett. 9(7): 1393-1399 (2015) - [j6]Mikel Álvarez-Mozos, Oriol Tejada:
The Banzhaf value in the presence of externalities. Soc. Choice Welf. 44(4): 781-805 (2015) - 2013
- [j5]Mikel Álvarez-Mozos, René van den Brink, Gerard van der Laan, Oriol Tejada:
Share functions for cooperative games with levels structure of cooperation. Eur. J. Oper. Res. 224(1): 167-179 (2013) - [j4]Mikel Álvarez-Mozos, Ziv Hellman, Eyal Winter:
Spectrum value for coalitional games. Games Econ. Behav. 82: 132-142 (2013) - 2012
- [j3]José María Alonso-Meijide, Mikel Álvarez-Mozos, M. Gloria Fiestras-Janeiro:
Notes on a comment on 2-efficiency and the Banzhaf value. Appl. Math. Lett. 25(7): 1098-1100 (2012) - 2011
- [j2]Mikel Álvarez-Mozos, Oriol Tejada:
Parallel characterizations of a generalized Shapley value and a generalized Banzhaf value for cooperative games with level structure of cooperation. Decis. Support Syst. 52(1): 21-27 (2011)
2000 – 2009
- 2009
- [j1]José M. Alonso-Meijide, Mikel Álvarez-Mozos, M. Gloria Fiestras-Janeiro:
Values of games with graph restricted communication and a priori unions. Math. Soc. Sci. 58(2): 202-213 (2009)
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-07-20 20:30 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:
