default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJuan J. Vidal-Puga
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j32]Penélope Hernández, Josep E. Peris
, Juan J. Vidal-Puga:
A non-cooperative approach to the folk rule in minimum cost spanning tree problems. Eur. J. Oper. Res. 307(2): 922-928 (2023)- [j31]Lina Mallozzi, Juan J. Vidal-Puga:
Equilibrium and dominance in fuzzy games. Fuzzy Sets Syst. 458: 94-107 (2023) - 2022
- [j30]Encarnación Algaba, René van den Brink, Hannu Salonen, Juan J. Vidal-Puga:
Essays in game theory in tribute to Francesc Carreras - SING 15. Ann. Oper. Res. 318(2): 743-747 (2022) - [j29]Marina Núñez, Juan J. Vidal-Puga:
Stable cores in information graph games. Games Econ. Behav. 132: 353-367 (2022) - 2021
- [j28]Lina Mallozzi, Juan J. Vidal-Puga:
Uncertainty in cooperative interval games: how Hurwicz criterion compatibility leads to egalitarianism. Ann. Oper. Res. 301(1): 143-159 (2021) - [j27]Juan D. Moreno-Ternero, Juan J. Vidal-Puga:
Aggregator operators for dynamic rationing. Eur. J. Oper. Res. 288(2): 682-691 (2021) - 2020
- [j26]Alfredo Valencia-Toledo, Juan J. Vidal-Puga:
Reassignment-proof rules for land rental problems. Int. J. Game Theory 49(1): 173-193 (2020) - [j25]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) - [j24]Gustavo Bergantiños, Juan J. Vidal-Puga:
One-way and two-way cost allocation in hub network problems. OR Spectr. 42(1): 199-234 (2020)
2010 – 2019
- 2018
- [j23]Gustavo Bergantiños, Alfredo Valencia-Toledo, Juan J. Vidal-Puga:
Hart and Mas-Colell consistency in PERT problems. Discret. Appl. Math. 243: 11-20 (2018) - [j22]Alfredo Valencia-Toledo, Juan J. Vidal-Puga:
Duality in land rental problems. Oper. Res. Lett. 46(1): 56-59 (2018) - 2017
- [j21]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) - 2015
- [j20]Gustavo Bergantiños, Juan J. Vidal-Puga:
Characterization of monotonic rules in minimum cost spanning tree problems. Int. J. Game Theory 44(4): 835-868 (2015) - [j19]M. Josune Albizuri, Juan J. Vidal-Puga:
Values and coalition configurations. Math. Methods Oper. Res. 81(1): 3-26 (2015) - 2012
- [j18]Juan J. Vidal-Puga:
The Harsanyi paradox and the "right to talk" in bargaining among coalitions. Math. Soc. Sci. 64(3): 214-224 (2012) - 2011
- [j17]Gustavo Bergantiños, Juan J. Vidal-Puga:
The folk solution and Boruvka's algorithm in minimum cost spanning tree problems. Discret. Appl. Math. 159(12): 1279-1283 (2011) - [j16]Maria Montero, Juan J. Vidal-Puga:
Demand bargaining and proportional payoffs in majority games. Games Econ. Behav. 71(2): 395-408 (2011) - [j15]María Gómez-Rúa, Juan J. Vidal-Puga:
Merge-proofness in minimum cost spanning tree problems. Int. J. Game Theory 40(2): 309-329 (2011) - 2010
- [j14]Gustavo Bergantiños, Juan J. Vidal-Puga:
Realizing fair outcomes in minimum cost spanning tree problems through non-cooperative mechanisms. Eur. J. Oper. Res. 201(3): 811-820 (2010) - [j13]María Gómez-Rúa, Juan J. Vidal-Puga:
The axiomatic approach to three values in games with coalition structure. Eur. J. Oper. Res. 207(2): 795-806 (2010) - [c1]M. Josune Albizuri, Juan J. Vidal-Puga:
Values and coalition configurations. BQGT 2010: 7:1
2000 – 2009
- 2009
- [j12]Gustavo Bergantiños, Juan J. Vidal-Puga:
A Value for PERT Problems. IGTR 11(4): 419-436 (2009) - 2008
- [j11]Juan J. Vidal-Puga:
Forming coalitions and the Shapley NTU value. Eur. J. Oper. Res. 190(3): 659-671 (2008) - [j10]Juan J. Vidal-Puga:
Delay in the alternating-offers model of bargaining. Int. J. Game Theory 37(4): 457-474 (2008) - 2007
- [j9]Gustavo Bergantiños, Juan J. Vidal-Puga:
The optimistic TU game in minimum cost spanning tree problems. Int. J. Game Theory 36(2): 223-239 (2007) - [j8]Gustavo Bergantiños, Juan J. Vidal-Puga:
A fair rule in minimum cost spanning tree problems. J. Econ. Theory 137(1): 326-352 (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]Gustavo Bergantiños, Juan J. Vidal-Puga:
Additive rules in discrete allocation problems. Eur. J. Oper. Res. 172(3): 971-978 (2006) - 2005
- [j5]Juan J. Vidal-Puga:
Implementation of the Levels Structure Value. Ann. Oper. Res. 137(1): 191-209 (2005) - [j4]Gustavo Bergantiños, Juan J. Vidal-Puga:
The Consistent Coalitional Value. Math. Oper. Res. 30(4): 832-851 (2005) - 2004
- [j3]Juan J. Vidal-Puga:
Bargaining with commitments. Int. J. Game Theory 33(1): 129-144 (2004) - [j2]Gustavo Bergantiños, Juan J. Vidal-Puga:
Additive rules in bankruptcy problems and other related problems. Math. Soc. Sci. 47(1): 87-101 (2004) - 2003
- [j1]Juan J. Vidal-Puga, Gustavo Bergantiños:
An implementation of the Owen value. Games Econ. Behav. 44(2): 412-427 (2003)
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 2025-01-21 00:15 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:
