Access Statistics for Josep E. Peris

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 1 14 0 2 4 72
- FIXED AGENDA SOCIAL CHOICE CORRESPONDENCES 0 0 0 6 0 0 1 49
- NUMERICAL REPRESENTATION OF CHOICE FUNCTIONS 0 0 0 19 1 4 6 222
A CHARACTERIZATION OF WEAK-MONOTONE MATRICES 0 0 0 1 0 2 4 338
A Characterization of Weak-Monotone Matrices 0 0 0 0 1 5 9 244
A Concessions-Based Mechanism for Meta-Bargaining Problems 0 1 1 24 1 6 11 141
A Consensual Committee Using Approval Balloting 0 0 0 27 1 9 11 90
A MECHANISM FOR META-BARGAINING PROBLEMS 0 0 0 9 1 3 6 63
A Non-Cooperative Approach to the Folk Rule in Minimum Cost Spanning Tree Problems 0 0 0 19 1 11 17 61
A Proportional Approach to Bankruptcy Problems with a guaranteed minimum 0 0 0 28 2 3 4 129
A Proportional Approach to Bankruptcy Problems with a guaranteed minimum 0 0 0 15 2 5 6 88
A Representative Committee by Approval Balloting 0 0 0 39 1 6 8 77
A Solution for General Exchange Markets with Indivisible Goods when Indifferences Are Allowed 0 0 0 56 1 2 3 154
A `Solidarity' Approach to the Problem of Sharing a Network Cost 0 0 0 9 0 2 5 47
A demand function for pseudotransitive preferences 0 0 0 8 1 4 6 48
A note on Luttens’ Minimal rights based solidarity 0 0 0 3 1 3 3 34
A proportional approach to bankruptcy. Problems with a guaranteed minimum 0 0 0 15 1 3 3 59
ADJUSTING CORRELATION MATRICES 0 0 0 45 0 4 6 108
An Egalitarian Approach for Sharing the Cost of a Spanning Tree 0 0 0 21 0 1 2 71
An egalitarian approach for sharing the cost of a spanning tree 0 0 0 8 1 4 5 20
CONDORCET CHOICE FUNCTIONS AND MAXIMAL ELEMENTS 0 0 0 34 0 1 5 158
Choosing among maximals 0 0 0 4 0 1 2 59
Compromise Solutions for Bankruptcy Situations: A Note 0 0 0 15 0 3 5 146
Compromise solutions for bankruptcy situations: a note 0 0 0 4 3 5 6 48
Condorcet choice correspondences for weak tournaments 0 0 0 14 0 2 5 56
Conflicting Claims Problem Associated with Cost Sharing of a Network 0 0 0 22 0 2 4 118
Conflicting claims problem associated with cost sharing of a network 0 0 0 19 0 1 3 256
Cost sharing solutions defined by non-negative eigenvectors 0 0 0 11 0 3 9 74
Distributing the European structural and investment funds from a conflicting claims approach 0 0 0 13 1 4 6 44
Equal Awards versus Equal Losses in Bankruptcy Problems 0 0 0 28 1 8 15 89
Fair Bounds Based Solidarity 0 0 0 13 0 1 3 89
Fair bound based solidarity 0 0 0 10 2 7 7 62
Fair bounds based solidarity 0 0 0 1 5 9 10 33
Fixed Agenda Social Choice Correspondences 0 0 0 0 0 9 13 176
Fixed agenda social choice correspondences 0 0 0 0 1 5 7 76
Folk Solution for Simple Minimum Cost Spanning Tree Problems 0 0 0 13 0 9 14 98
Folk solution for simple minimum cost spanning tree problems 0 0 0 8 2 7 7 69
From Bargaining Solutions to Claims Rules: A Proportional Approach 0 0 0 32 1 5 6 109
From bargaining solutions to claims rules: a proportional approach 0 0 0 15 6 13 15 69
M-stability: A reformulation of Von Neumann-Morgenstern stability 0 0 0 59 0 4 6 242
Maximal elements of non necessarily acyclic binary relations 0 0 0 13 0 3 4 96
Mediation in Bankruptcy Problems 0 0 0 40 0 2 3 171
Mixing Solutions in Claims Problems 0 0 0 7 0 6 13 49
Numerical representation for lower quasi-continuous preferences 0 0 0 8 1 4 4 53
Perron's Eigenvector for Matrices in Distribution Problems 0 0 0 0 0 6 9 88
Perron's Eigenvector for Matrices in Distribution Problems 0 0 0 14 0 1 5 111
Randomly Selected Representative Committees 0 0 0 55 0 5 7 198
Rationalizable Choice and Standards of Behavior 0 0 0 13 0 2 4 76
Resource Allocation with Warranties in Claims Problems 0 0 0 21 1 4 10 64
Resource allocation with warranties in claims problems 0 0 0 8 1 8 12 51
Revealed preference axioms for rational choice on nonfinite sets 0 0 0 9 1 5 6 60
Sharing Costs and the Compromise Solution 0 0 1 26 0 8 12 96
Sharing the Cost of Maximum Quality Optimal Spanning Trees 0 0 0 24 2 8 9 57
Solidarity and uniform rules in bankruptcy problems 0 0 0 13 2 7 9 60
Solidarity and uniform rules in bankruptcy problems 0 0 0 22 3 8 10 136
Stability versus rationality in choice functions 0 0 0 25 0 5 8 279
Stable sets: a descriptive and comparative analysis 0 0 0 34 0 1 3 148
Strategic Sharing of a Costly Network 0 0 0 52 0 2 4 164
THREE KINDS OF UTILITY FUNCTIONS FROM THE MEASURE CONCEPT 0 0 0 36 0 1 6 373
VETO IN FIXED AGENDA SOCIAL CHOICE CORRESPONDENCES 0 0 0 1 0 1 1 32
Total Working Papers 0 1 3 1,102 49 265 407 6,548

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 4 7 15
A Representative Committee by Approval Balloting 0 0 0 1 2 7 15 36
A Solution for General Exchange Markets with Indivisible Goods when Indifferences are Allowed 0 0 0 14 1 3 4 60
A claims problem approach to the cost allocation of a minimum cost spanning tree 0 0 0 0 1 7 9 13
A non-cooperative approach to the folk rule in minimum cost spanning tree problems 0 0 0 0 2 5 7 14
A note on adjusting correlation matrices 0 0 0 147 0 3 6 333
A proportional approach to claims problems with a guaranteed minimum 0 0 0 9 1 5 9 54
A reformulation of von Neumann–Morgenstern stability: m-stability 0 0 0 4 0 6 9 36
A weak utility function for acyclic preferences 0 0 0 41 0 1 3 119
An egalitarian approach for sharing the cost of a spanning tree 0 0 0 0 1 5 6 13
An oligarchy theorem in fixed agenda without Pareto conditions 0 0 0 9 0 2 7 76
Characterization of social choice sets in terms of individuals' maximal sets: The fixed agenda framework 0 0 0 17 0 3 4 111
Choice Functions: Rationality re-Examined 0 0 0 2 1 2 7 29
Condorcet choice correspondences for weak tournaments 0 0 0 27 3 7 10 242
Condorcet choice functions and maximal elements 0 0 0 13 0 7 9 90
Cost sharing solutions defined by non-negative eigenvectors 0 0 0 1 2 7 9 48
Demand correspondence for pseudo-transitive preferences 0 0 0 11 0 1 4 108
Demand correspondence for pseudotransitive preferences 0 0 0 10 4 6 8 94
Distributing the European structural and investment funds from a conflicting claims approach 0 0 1 3 0 3 9 23
Equalizing solutions for bankruptcy problems revisited 0 0 0 0 1 7 8 11
From Bargaining Solutions to Claims Rules: A Proportional Approach 0 0 0 8 4 12 15 71
Hierarchies of power in non-binary social choice 0 0 1 10 0 1 5 61
Linear Joint-Production Models 0 0 0 0 0 6 8 269
Maximal elements of not necessarily acyclic binary relations 0 0 0 33 0 3 7 125
Mediation in claims problems 0 0 0 2 1 4 6 33
Mixing solutions for claims problems 0 0 0 0 1 2 5 7
Nontrivial pseudo-utility functions 0 0 0 17 2 6 8 109
Numerical representation for lower quasi-continuous preferences 0 0 0 26 0 3 6 93
Numerical representation of choice functions 0 0 0 0 0 1 1 6
Participation and Solidarity in Redistribution Mechanisms 0 0 0 7 1 3 4 66
Rational stability of choice functions 0 0 2 3 0 6 9 12
Resource allocations with guaranteed awards in claims problems 0 0 0 1 0 4 5 14
Revealed preference axioms for continuous rational choice 0 0 0 16 0 3 7 105
Sharing the cost of maximum quality optimal spanning trees 0 0 1 2 4 10 16 30
Strategic sharing of a costly network 0 0 0 1 3 3 6 27
Strong maximals: Elements with maximal score in partial orders 0 0 0 16 6 11 15 154
Veto in fixed agenda social choice correspondences 0 0 0 4 3 6 9 98
Total Journal Articles 0 0 5 456 44 175 282 2,805

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-03-04