default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJorge Oviedo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Agustín G. Bonifacio
, Noelia Juárez, Pablo Neme, Jorge Oviedo:
Core and stability notions in many-to-one matching markets with indifferences. Int. J. Game Theory 53(1): 143-157 (2024)- [i1]Agustín G. Bonifacio, Nadia Guiñazú, Noelia Juárez, Pablo Neme, Jorge Oviedo:
Counting steps for re-stabilization in a labor matching market. CoRR abs/2405.07084 (2024) - 2022
- [j14]Noelia Juárez, Pablo Neme, Jorge Oviedo:
Lattice structure of the random stable set in many-to-many matching markets. Games Econ. Behav. 132: 255-273 (2022) - [j13]Agustín G. Bonifacio, Nadia Guiñazú, Noelia Juárez, Pablo Neme, Jorge Oviedo:
The lattice of worker-quasi-stable matchings. Games Econ. Behav. 135: 188-200 (2022) - [j12]Agustín G. Bonifacio, Noelia Juárez, Pablo Neme, Jorge Oviedo:
Cycles to compute the full set of many-to-many stable matchings. Math. Soc. Sci. 117: 20-29 (2022) - 2021
- [j11]Pablo Neme, Jorge Oviedo:
On the set of many-to-one strongly stable fractional matchings. Math. Soc. Sci. 110: 1-13 (2021)
2010 – 2019
- 2019
- [j10]Elvio Accinelli, Filipe Martins, Jorge Oviedo:
Evolutionary Game Theory: A Generalization of the ESS Definition. IGTR 21(4): 1950005:1-1950005:19 (2019) - 2012
- [j9]Ruth Martínez, Jordi Massó, Alejandro Neme, Jorge Oviedo:
On the invariance of the set of Core matchings with respect to preference profiles. Games Econ. Behav. 74(2): 588-600 (2012) - 2011
- [j8]Delfina Femenia, Mabel Marí, Alejandro Neme, Jorge Oviedo:
Stable solutions on Matching Models with quota restriction. IGTR 13(2): 159-179 (2011) - 2010
- [j7]Patricia Lucia Galdeano, Jorge Oviedo, Luis Guillermo Quintas:
Shapley Value in a Model of Information Transferal. IGTR 12(1): 19-35 (2010)
2000 – 2009
- 2008
- [j6]Ruth Martínez, Jordi Massó, Alejandro Neme, Jorge Oviedo:
On the invariance of the set of stable matchings with respect to substitutable preference profiles. Int. J. Game Theory 36(3-4): 497-518 (2008) - 2004
- [j5]Ruth Martínez, Jordi Massó, Alejandro Neme, Jorge Oviedo:
On group strategy-proof mechanisms for a many-to-one matching model. Int. J. Game Theory 33(1): 115-128 (2004) - [j4]Federico Echenique, Jorge Oviedo:
Core many-to-one matchings by fixed-point methods. J. Econ. Theory 115(2): 358-376 (2004) - [j3]Ruth Martínez, Jordi Massó, Alejandro Neme, Jorge Oviedo:
An algorithm to compute the full set of many-to-many stable matchings. Math. Soc. Sci. 47(2): 187-210 (2004) - 2000
- [j2]Jorge Oviedo:
The core of a repeated n-person cooperative game. Eur. J. Oper. Res. 127(3): 519-524 (2000) - [j1]Ruth Martínez, Jordi Massó, Alejandro Neme, Jorge Oviedo:
Single Agents and the Set of Many-to-One Stable Matchings. J. Econ. Theory 91(1): 91-105 (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-10-09 21:31 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:
