Alejandro Neme

According to our database1, Alejandro Neme authored at least 22 papers between 1992 and 2021.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
Effort of rugby teams according to the bonus point system: a theoretical and empirical analysis.
Int. J. Game Theory, 2021

2020
On obvious strategy-proofness and single-peakedness.
J. Econ. Theory, 2020

2017
On societies choosing social outcomes, and their memberships: strategy-proofness.
Soc. Choice Welf., 2017

2015
The division problem under constraints.
Games Econ. Behav., 2015

2014
On cooperative solutions of a generalized assignment game: Limit theorems to the set of competitive equilibria.
J. Econ. Theory, 2014

On the Structure of Cooperative and Competitive Solutions for a Generalized Assignment Game.
J. Appl. Math., 2014

2012
The division problem with voluntary participation.
Soc. Choice Welf., 2012

The multiple-partners assignment game with heterogeneous sales and multi-unit demands: competitive equilibria.
Math. Methods Oper. Res., 2012

On the invariance of the set of Core matchings with respect to preference profiles.
Games Econ. Behav., 2012

2011
Stable solutions on Matching Models with quota restriction.
IGTR, 2011

2008
On the invariance of the set of stable matchings with respect to substitutable preference profiles.
Int. J. Game Theory, 2008

2007
An undominated Nash equilibrium for voting by committees with exit.
Math. Soc. Sci., 2007

Bribe-proof rules in the division problem.
Games Econ. Behav., 2007

2006
On Exiting After Voting.
Int. J. Game Theory, 2006

2005
Voting by committees under constraints.
J. Econ. Theory, 2005

2004
A maximal domain of preferences for strategy-proof, efficient, and simple rules in the division problem.
Soc. Choice Welf., 2004

Stability and voting by committees with exit.
Soc. Choice Welf., 2004

An algorithm to compute the full set of many-to-many stable matchings.
Math. Soc. Sci., 2004

On group strategy-proof mechanisms for a many-to-one matching model.
Int. J. Game Theory, 2004

2001
Maximal Domain of Preferences in the Division Problem.
Games Econ. Behav., 2001

2000
Single Agents and the Set of Many-to-One Stable Matchings.
J. Econ. Theory, 2000

1992
Nash equilibrium strategies in repeated games with and without cost of implementation.
Oper. Res. Lett., 1992


  Loading...