Pablo Amorós

According to our database, Pablo Amorós authored at least 11 papers between 2002 and 2024.

Collaborative distances:

• Dijkstra number of six.
• Erdős number of six.

2024

Nash implementation of supermajority rules.

Pablo Amorós

Int. J. Game Theory, September, 2024

2023

Implementing optimal scholarship assignments via backward induction.

Pablo Amorós

Math. Soc. Sci., September, 2023

2020

Aggregating experts' opinions to select the winner of a competition.

Pablo Amorós

Int. J. Game Theory, 2020

2019

Choosing the winner of a competition using natural mechanisms: Conditions based on the jury.

Pablo Amorós

Math. Soc. Sci., 2019

2016

Subgame perfect implementation of the deserving winner of a competition with natural mechanisms.

Pablo Amorós

Math. Soc. Sci., 2016

2013

Picking the winners.

Pablo Amorós

Int. J. Game Theory, 2013

2009

Unequivocal majority and Maskin-monotonicity.

Pablo Amorós

Soc. Choice Welf., 2009

Eliciting socially optimal rankings from unfair jurors.

Pablo Amorós

J. Econ. Theory, 2009

2004

Nash implementation and uncertain renegotiation.

Pablo Amorós

Games Econ. Behav., 2004

2002

Single-peaked preferences with several commodities.

Pablo Amorós

Soc. Choice Welf., 2002

The Scholarship Assignment Problem.

Pablo Amorós, Luis C. Corchón, Bernardo Moreno

Games Econ. Behav., 2002