Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBalbina Casas-Méndez
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i3]José M. Alonso-Meijide, Livino M. Armijos-Toro, Balbina V. Casas Méndez, Manuel A. Mosquera:
An application of power indices for the family of weighted majority games in partition function form. CoRR abs/2402.06333 (2024)- 2023
- [j20]Alejandro Saavedra-Nieves
, Balbina Casas-Méndez:
On the centrality analysis of covert networks using games with externalities. Eur. J. Oper. Res. 309(3): 1365-1378 (2023) - [j19]Laura Davila-Pena, David R. Penas, Balbina Casas-Méndez:
A new two-phase heuristic for a problem of food distribution with compartmentalized trucks and trailers. Int. Trans. Oper. Res. 30(2): 1031-1064 (2023) - 2022
- [j18]Laura Davila-Pena, Ignacio García-Jurado, Balbina Casas-Méndez:
Assessment of the influence of features on a classification problem: An application to COVID-19 patients. Eur. J. Oper. Res. 299(2): 631-641 (2022) - 2021
- [i2]Laura Davila-Pena, Ignacio García-Jurado, Balbina Casas-Méndez:
Assessment of the influence of features on a classification problem: an application to COVID-19 patients. CoRR abs/2104.14958 (2021)
2010 – 2019
- 2016
- [j17]Jorge Rodríguez Veiga, Guido I. Novoa Flores, Balbina V. Casas Méndez:
Implementing generating functions to obtain power indices with coalition configuration. Discret. Appl. Math. 214: 1-15 (2016) - 2015
- [j16]José María Alonso-Meijide, Balbina Casas-Méndez, M. Gloria Fiestras-Janeiro:
Computing Banzhaf-Coleman and Shapley-Shubik power indices with incompatible players. Appl. Math. Comput. 252: 377-387 (2015) - [i1]Jorge Rodríguez Veiga, Guido I. Novoa Flores, Balbina V. Casas Méndez:
Implementing generating functions to obtain power indices with coalition configuration. CoRR abs/1507.00216 (2015) - 2013
- [j15]Luisa Carpente, Balbina Casas-Méndez, Javier Gozálvez, Natividad Llorca, Manuel A. Pulido, Joaquín Sánchez-Soriano:
How to divide a cake when people have different metabolism? Math. Methods Oper. Res. 78(3): 361-371 (2013) - 2011
- [j14]Balbina Casas-Méndez, Vito Fragnelli, Ignacio García-Jurado:
Weighted bankruptcy rules and the museum pass problem. Eur. J. Oper. Res. 215(1): 161-168 (2011) - 2010
- [j13]Luisa Carpente, Balbina Casas-Méndez, Ignacio García-Jurado, Anne van den Nouweland:
The truncated core for games with upper bounds. Int. J. Game Theory 39(4): 645-656 (2010) - [j12]José M. Alonso-Meijide, Balbina Casas-Méndez, M. Gloria Fiestras-Janeiro, Manfred J. Holler, Andreas Nohn:
Axiomatizations of public good indices with a priori unions. Soc. Choice Welf. 35(3): 517-533 (2010)
2000 – 2009
- 2009
- [j11]José M. Alonso-Meijide, Jesús Mario Bilbao, Balbina Casas-Méndez, Julio Rodrigo Fernández García:
Weighted multiple majority games with unions: Generating functions and applications to the European Union. Eur. J. Oper. Res. 198(2): 530-544 (2009) - 2008
- [j10]José M. Alonso-Meijide, Balbina Casas-Méndez, Manfred J. Holler, Silvia Lorenzo-Freire:
Computing power indices: Multilinear extensions and new characterizations. Eur. J. Oper. Res. 188(2): 540-554 (2008) - 2007
- [j9]Silvia Lorenzo-Freire, José M. Alonso-Meijide, Balbina Casas-Méndez, M. Gloria Fiestras-Janeiro:
Characterizations of the Deegan-Packel and Johnston power indices. Eur. J. Oper. Res. 177(1): 431-444 (2007) - [j8]Silvia Lorenzo-Freire, José M. Alonso-Meijide, Balbina Casas-Méndez, Ruud Hendrickx:
Balanced contributions for TU games with awards and applications. Eur. J. Oper. Res. 182(2): 958-964 (2007) - [j7]Gustavo Bergantiños, Balbina Casas-Méndez, M. Gloria Fiestras-Janeiro, Juan J. Vidal-Puga:
A solution for bargaining problems with coalition structure. Math. Soc. Sci. 54(1): 35-58 (2007) - 2006
- [j6]Luisa Carpente, Balbina Casas-Méndez, Ignacio García-Jurado, Anne van den Nouweland:
The Shapley Valuation Function for Strategic Games in which Players Cooperate. Math. Methods Oper. Res. 63(3): 435-442 (2006) - 2005
- [j5]Peter Borm, Luisa Carpente, Balbina Casas-Méndez, Ruud Hendrickx:
The Constrained Equal Awards Rule for Bankruptcy Problems with a Priori Unions. Ann. Oper. Res. 137(1): 211-227 (2005) - [j4]Luisa Carpente, Balbina Casas-Méndez, Ignacio García-Jurado, Anne van den Nouweland:
Values for strategic games in which players cooperate. Int. J. Game Theory 33(3): 397-419 (2005) - 2003
- [j3]Balbina Casas-Méndez, Ignacio García-Jurado, Anne van den Nouweland, Margarita Vázquez-Brage:
An extension of the tau-value to games with coalition structures. Eur. J. Oper. Res. 148(3): 494-513 (2003) - [j2]Balbina Casas-Méndez, José Manuel Prada-Sánchez:
On the properties of solutions for NTU communication situations 1. Math. Methods Oper. Res. 58(3): 417-439 (2003) - 2000
- [j1]Gustavo Bergantiños, Balbina Casas-Méndez, Margarita Vázquez-Brage:
A Non-Cooperative Bargaining Procedure generalising the Kalai-Smorodinsky Bargaining Solution to NTU Games. IGTR 2(4): 273-286 (2000)
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-02-19 23:13 CET 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:
