Access Statistics for Jorge Oviedo

Author contact details at EconPapers.

Working Paper File Downloads Abstract Views
Last month 3 months 12 months Total Last month 3 months 12 months Total
A Theory of Stability in Many-to-Many Matching Markets 0 0 0 53 1 3 15 260
A Theory of Stability in Many-to-Many Matching Markets 0 0 0 37 1 3 13 250
A Theory of Stability in Many-to-many Matching Markets 0 0 0 182 0 3 22 625
A Theory of Stability in Many-to-many Matching Markets 0 0 1 62 0 1 17 281
A decomposition from a many-to-one matching market with path-independent choice functions to a one-to-one matching market 0 0 1 3 0 1 5 9
AN ALGORITHM TO COMPUTE THE SET OF MANY-TO-MANY STABLE MATCHINGS 0 0 0 76 1 1 6 247
Core Many-To-One Matchings by Fixed-Point Methods 0 0 0 62 0 0 16 251
Core Many-to-one Matchings by Fixed-point Methods 0 0 0 210 0 0 15 538
Core and Stability Notions in Many-to-one Matching Markets with Indifferences 0 0 0 10 0 0 15 39
Core and stability notions in many-to-one matching markets with indifferences 0 0 0 11 0 1 16 42
Counting Steps for Re-Stabilization in a Labor Matching Market 0 0 0 0 0 2 13 17
Counting steps for re-stabilization in a labor matching market 0 1 1 1 0 2 5 12
Cycles to Compute the Full Set of Many-to-many Stable Matchings 0 0 0 6 0 0 9 22
Cycles to compute the full set of many-to-many stable matchings 0 0 0 4 1 2 11 18
Dynamic matching games: stationary equilibria under varying commitments 0 0 1 5 0 3 6 12
General Manipulability Theorem for a Matching Model 0 0 0 13 0 0 8 14
Lattice structure of the random stable set in many-to-many matching market 0 0 0 10 0 3 16 41
Lattice structure of the random stable set in many-to-many matching markets 0 0 0 8 1 2 22 41
Marriage market with indifferences: A linear programming approach 0 0 1 11 1 1 12 41
Nash Implementation in a many-to-one Matching Market 0 0 0 11 1 1 15 35
Nash implementation in a many-to-one matching market 0 0 0 12 0 1 6 20
On group strategy-proof mechanisms for a many-to-one matching model 0 0 0 128 0 3 12 528
On the Invariance of the Set of Core Matchings with Respect to Preference Profiles 0 0 0 1 0 1 6 39
On the Invariance of the Set of Core Matchings with Respect to Preference Profiles 0 0 0 7 0 0 10 61
On the many-to-one strongly stable fractional matching set 0 0 0 14 0 1 18 54
On the set of many-to-one strongly stable fractional matchings 0 0 0 6 0 0 10 24
Quasi-stability notions in two-sided matching models 0 0 0 14 0 1 8 22
The Lattice of Envy-Free Many-to-Many Matchings with Contracts 0 0 0 4 0 0 14 24
The lattice of envy-free many-to-many matchings with contracts 0 0 0 6 0 1 10 24
The lattice of worker-quasi-stable matchings 0 0 0 6 0 1 5 23
The lattice of worker-quasi-stable matchings 0 0 0 5 1 2 14 36
The lattice of worker-quasi-stable matchings 0 0 0 3 0 0 11 22
Total Working Papers 0 1 5 981 8 40 381 3,672

Journal Article File Downloads Abstract Views
Last month 3 months 12 months Total Last month 3 months 12 months Total
A characterization of strongly stable fractional matchings 0 0 0 1 1 1 5 27
A theory of stability in many-to-many matching markets 0 0 0 126 0 3 26 483
An algorithm to compute the full set of many-to-many stable matchings 0 0 0 58 0 0 7 258
Core and stability notions in many-to-one matching markets with indifferences 0 0 1 2 1 3 17 27
Core many-to-one matchings by fixed-point methods 0 0 1 61 0 3 14 241
Cycles to compute the full set of many-to-many stable matchings 0 0 0 1 0 0 12 17
Evolutionary Game Theory: A Generalization of the ESS Definition 0 0 0 13 0 0 17 77
Lattice structure of the random stable set in many-to-many matching markets 0 0 0 1 0 0 19 27
Lexicographic optimality in the multiple objective linear programming: The nucleolar solution 0 0 0 68 0 0 9 167
Modelo de planificación balanceado y modelo de asignación 0 0 1 24 0 1 10 474
On group strategy-proof mechanisms for a many-to-one matching model 0 0 0 27 0 1 5 192
On the invariance of the set of Core matchings with respect to preference profiles 0 0 0 3 0 1 7 49
On the invariance of the set of stable matchings with respect to substitutable preference profiles 0 0 0 14 0 1 12 76
On the set of many-to-one strongly stable fractional matchings 0 0 0 4 1 1 12 21
Optimal values and strategies for a particular case of two-person games 0 0 0 1 0 0 8 34
Quasi-stability notions in two-sided matching models 0 0 0 0 1 1 2 2
SHAPLEY VALUE IN A MODEL OF INFORMATION TRANSFERAL 0 0 0 0 0 0 4 14
STABLE SOLUTIONS ON MATCHING MODELS WITH QUOTA RESTRICTION 0 0 0 1 1 2 6 20
Single Agents and the Set of Many-to-One Stable Matchings 0 0 0 73 0 0 12 239
The Blocking Lemma for a many-to-one matching model 0 0 0 9 0 0 10 93
The core of a further m-sided assignment game 0 0 0 10 0 1 11 41
The core of a repeated n-person cooperative game 0 0 0 29 2 2 10 111
The lattice of envy-free many-to-many matchings with contracts 0 0 0 0 0 0 8 13
The lattice of worker-quasi-stable matchings 0 0 0 1 1 1 9 17
The value of information in a cooperative environment 1 1 3 21 1 2 17 142
Total Journal Articles 1 1 6 548 9 24 269 2,862

logo

LogEc Home

Top Working Papers
Top Journal Articles
Top Books
Top Chapters
Top Software Items

Top Authors

Top Working Paper series and Journals

About LogEc

Authors with papers registered in the RePEc Author Service.

Register yourself as an author or register more papers in the RePEc Author Service.

Authors with no registered papers

RePEc
LogEc provides access and usage statistics for services based on the RePEc data set.

Örebro UniversityLogEc is hosted by the Örebro University School of Business.

Questions or comments? Please see our explanation of how the statistics are collected or e-mail

Since October 2025, abstract view statistics are potentially heavily influenced by traffic from AI bots and tools that we could not eliminate despite our best efforts.

Statistics updated 2026-10-11