Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
geoffrey e hinton
Mohammed Ahmed
Claudia Calabrese
Xiaopeng Guo
Hao Mao
Peter Malec
Arthur Bernhard
Chen Ma
Radu Timofte
Kuanrui Yin
Home
/
Author
/
JORDI MASSÓ
Author Info
Open Visualization
Name
Affiliation
Papers
JORDI MASSÓ
Universitat Autònoma de Barcelona and Barcelona GSE, Departament d'Economia i d'Història Econòmica, Edifici B, UAB, 08193, Bellaterra (Barcelona), Spain
24
Collaborators
Citations
PageRank
17
103
16.46
Referers
Referees
References
154
85
91
Search Limit
100
154
Publications (24 rows)
Collaborators (17 rows)
Referers (100 rows)
Referees (85 rows)
Title
Citations
PageRank
Year
Corrigendum to “On strategy-proofness and semilattice single-peakedness” [Games Econ. Behav. 124 (2020) 219–238]
0
0.34
2021
On strategy-proofness and semilattice single-peakedness
0
0.34
2020
On societies choosing social outcomes, and their memberships: strategy-proofness.
0
0.34
2017
Matching markets under (in)complete information.
5
0.90
2015
On cost sharing in the provision of a binary and excludable public good.
5
0.59
2015
The division problem under constraints.
1
0.38
2015
On the Structure of Cooperative and Competitive Solutions for a Generalized Assignment Game.
0
0.34
2014
On cooperative solutions of a generalized assignment game: Limit theorems to the set of competitive equilibria.
1
0.40
2014
The multiple-partners assignment game with heterogeneous sales and multi-unit demands: competitive equilibria.
8
0.81
2012
The Division Problem with Voluntary Participation
4
0.67
2012
On the invariance of the set of Core matchings with respect to preference profiles.
2
0.41
2012
On strategy-proofness and symmetric single-peakedness
2
0.39
2011
Efficient and stable collective choices under gregarious preferences
0
0.34
2008
On the invariance of the set of stable matchings with respect to substitutable preference profiles
2
0.70
2008
Bribe-proof rules in the division problem
6
0.64
2007
An undominated Nash equilibrium for voting by committees with exit
2
0.45
2007
Incomplete information and singleton cores in matching markets
17
2.01
2007
Voting by committees under constraints
11
1.43
2005
An algorithm to compute the full set of many-to-many stable matchings
9
0.76
2004
A maximal domain of preferences for strategy-proof, efficient, and simple rules in the division problem
4
0.69
2004
Stability and voting by committees with exit
7
0.70
2004
Weak stability and a bargaining set for the marriage model
9
1.53
2003
The Chi-compromise value for non-transferable utility games
1
0.45
2002
Maximal Domain of Preferences in the Division Problem
7
0.84
2001
1