Access Statistics for Begoña Subiza

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
- CHOICE FUNCTIONS: RATIONALITY RE-EXAMINED 0 0 0 14 0 0 5 74
- NUMERICAL REPRESENTATION OF CHOICE FUNCTIONS 0 0 0 19 0 0 7 224
A CHARACTERIZATION OF WEAK-MONOTONE MATRICES 0 0 0 1 0 1 6 340
A Characterization of Weak-Monotone Matrices 0 0 0 0 0 1 12 247
A Concessions-Based Mechanism for Meta-Bargaining Problems 0 0 1 24 0 0 12 143
A Consensual Committee Using Approval Balloting 0 0 0 27 1 1 15 94
A KKM-RESULT AND AN APPLICATION FOR BINARY AND NON-BINARY CHOICE FUNCTIONS 0 0 0 16 0 0 7 106
A MECHANISM FOR META-BARGAINING PROBLEMS 0 0 0 9 0 0 11 68
A Representative Committee by Approval Balloting 0 0 0 39 0 1 11 80
A Solution for General Exchange Markets with Indivisible Goods when Indifferences Are Allowed 0 0 0 56 0 1 8 159
A `Solidarity' Approach to the Problem of Sharing a Network Cost 0 0 0 9 0 0 6 48
A `solidarity' approach to the problem of sharing a network cost 0 0 0 13 0 0 12 51
A characterization of acyclic preferences on countable sets 0 0 0 39 0 0 5 139
A demand function for pseudotransitive preferences 0 0 0 8 1 1 9 51
ADJUSTING CORRELATION MATRICES 0 0 0 45 0 0 6 109
Affirmative Action and School Choice 0 0 0 50 0 0 10 196
An Egalitarian Approach for Sharing the Cost of a Spanning Tree 0 0 0 21 0 0 2 72
An egalitarian approach for sharing the cost of a spanning tree 0 0 0 8 0 1 8 23
CONDORCET CHOICE FUNCTIONS AND MAXIMAL ELEMENTS 0 0 0 34 0 0 7 160
Choosing among maximals 0 0 0 4 0 1 5 62
Condorcet choice correspondences for weak tournaments 0 0 0 14 0 0 8 59
Conflicting Claims Problem Associated with Cost Sharing of a Network 0 0 0 22 0 0 6 121
Conflicting claims problem associated with cost sharing of a network 0 0 0 19 0 1 3 257
Cost sharing solutions defined by non-negative eigenvectors 0 0 0 11 0 0 7 75
Equal-loss solution for monotonic coalitional games 0 0 0 4 0 0 9 33
Folk Solution for Simple Minimum Cost Spanning Tree Problems 0 0 0 13 0 0 16 102
Folk solution for simple minimum cost spanning tree problems 0 0 0 8 0 2 10 72
M-stability: A reformulation of Von Neumann-Morgenstern stability 0 0 0 59 0 2 8 245
Maximal elements of non necessarily acyclic binary relations 0 0 0 13 0 1 7 99
Minimum Cost Spanning Tree Games with Revenues: “Stable” Payoffs when the Core is Empty 0 0 1 8 0 1 11 23
NUMERICAL REPRESENTATION OF ACYCLIC PREFERENCES 0 0 0 15 0 0 9 67
Non-Emptiness of the Core of MCST Games with Revenues: a Necessary and Some Sufficient Conditions 0 0 1 4 1 2 16 25
Nonempty core of minimum cost spanning tree games with revenues 0 0 0 0 0 1 4 9
Numerical representation for lower quasi-continuous preferences 0 0 0 8 0 1 6 55
Numerical representation of partial orderings 0 0 0 3 0 1 8 43
On Integration Policies and Schooling 0 0 0 15 1 2 15 96
On integration policies and schooling 0 0 0 8 0 1 11 118
Perron's Eigenvector for Matrices in Distribution Problems 0 0 0 0 0 0 10 89
Perron's Eigenvector for Matrices in Distribution Problems 0 0 0 14 0 0 8 114
Randomly Selected Representative Committees 0 2 2 57 1 5 13 205
Rationalizable Choice and Standards of Behavior 0 0 0 13 0 1 8 80
Revealed preference axioms for rational choice on nonfinite sets 0 0 0 9 0 0 7 61
Sharing the Cost of Maximum Quality Optimal Spanning Trees 0 0 0 24 1 2 12 60
Stability versus rationality in choice functions 0 0 0 25 0 0 12 283
Stable sets: a descriptive and comparative analysis 0 0 0 34 0 0 4 149
THREE KINDS OF UTILITY FUNCTIONS FROM THE MEASURE CONCEPT 0 0 0 36 0 0 6 374
Total Working Papers 0 2 5 872 6 31 398 5,360

Journal Article File Downloads Abstract Views
Last month 3 months 12 months Total Last month 3 months 12 months Total
A Concessions-Based Procedure for Meta-Bargaining Problems 0 0 0 1 0 0 7 15
A KKM-result and an application for binary and non-binary choice functions 0 0 0 46 1 2 8 334
A Representative Committee by Approval Balloting 0 0 0 1 1 1 18 39
A Solution for General Exchange Markets with Indivisible Goods when Indifferences are Allowed 0 0 0 14 0 0 6 62
A claims problem approach to the cost allocation of a minimum cost spanning tree 0 0 0 0 0 1 12 17
A note on adjusting correlation matrices 0 0 0 147 0 0 6 333
A reformulation of von Neumann–Morgenstern stability: m-stability 0 0 0 4 0 0 10 38
A weak utility function for acyclic preferences 0 0 0 41 2 2 5 122
Affirmative action and school choice 0 0 0 1 0 1 9 50
An egalitarian approach for sharing the cost of a spanning tree 0 0 0 0 1 1 9 16
Choice Functions: Rationality re-Examined 0 0 0 2 0 3 11 35
Condorcet choice correspondences for weak tournaments 0 0 0 27 0 0 11 244
Condorcet choice functions and maximal elements 0 0 0 13 1 1 13 94
Cooperative TU-games: Dominance, stable sets, and the core revisited 0 1 2 2 0 4 16 16
Cost sharing solutions defined by non-negative eigenvectors 0 0 0 1 0 0 11 50
Demand correspondence for pseudo-transitive preferences 0 0 0 11 0 0 6 111
Demand correspondence for pseudotransitive preferences 0 0 0 10 2 2 13 100
Irreducible minimum cost spanning tree problems with revenues 0 0 0 0 0 0 0 0
Maximal elements of not necessarily acyclic binary relations 0 0 0 33 0 0 7 126
Non-emptiness of the core of mcst games with revenues 0 0 0 0 2 2 4 4
Nontrivial pseudo-utility functions 0 0 0 17 0 0 9 111
Numerical representation for lower quasi-continuous preferences 0 0 0 26 1 3 7 96
Numerical representation of choice functions 0 0 0 0 0 2 4 9
Rational stability of choice functions 0 0 1 3 1 2 15 19
Revealed preference axioms for continuous rational choice 0 0 0 16 0 0 7 106
Sharing the cost of maximum quality optimal spanning trees 0 0 0 2 2 6 24 39
Strong maximals: Elements with maximal score in partial orders 0 0 0 16 0 0 17 157
Total Journal Articles 0 1 3 434 14 33 265 2,343

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-08-07