Alejandro Neme

Available identifiers

zbMath Open neme.alejandro-jWikidataQ102361910 ScholiaQ102361910MaRDI QIDQ427508

List of research outcomes

Publication	Date of Publication	Type
All sequential allotment rules are obviously strategy‐proof	2023-10-17	Paper
Order-\(k\) rationality	2022-05-31	Paper
Effort of rugby teams according to the bonus point system: a theoretical and empirical analysis	2021-07-15	Paper
On obvious strategy-proofness and single-peakedness	2020-02-17	Paper
On the structure of cooperative and competitive solutions for a generalized assignment game	2019-11-19	Paper
On societies choosing social outcomes, and their memberships: strategy-proofness	2018-03-08	Paper
On societies choosing social outcomes, and their memberships: internal stability and consistency	2018-02-08	Paper
Stable partitions in many division problems: the proportional and the sequential dictator solutions	2015-11-13	Paper
The division problem under constraints	2015-05-19	Paper
On cooperative solutions of a generalized assignment game: limit theorems to the set of competitive equilibria	2014-11-19	Paper
The multiple-partners assignment game with heterogeneous sales and multi-unit demands: competitive equilibria	2013-02-20	Paper
The division problem with voluntary participation	2012-06-13	Paper
Stable solutions on matching models with quota restriction	2012-05-11	Paper
On the invariance of the set of core matchings with respect to preference profiles	2012-03-19	Paper
The blocking lemma for a many-to-one matching model	2011-01-21	Paper
On the invariance of the set of stable matchings with respect to substitutable preference profiles	2008-04-23	Paper
Bribe-proof rules in the division problem	2007-11-30	Paper
An undominated Nash equilibrium for voting by committees with exit	2007-10-10	Paper
Maximal domains of preferences preserving strategy-proofness for generalized median voter schemes	2005-08-22	Paper
Voting by committees under constraints	2005-08-05	Paper
Stability and voting by committees with exit	2005-02-11	Paper
A maximal domain of preferences for strategy-proof, efficient, and simple rules in the division problem	2005-02-11	Paper
An algorithm to compute the full set of many-to-many stable matchings.	2004-06-11	Paper
Maximal domain of preferences in the division problem	2002-09-30	Paper
On the lattice structure of the set of stable matchings for a many-to-one model∗	2002-05-22	Paper
Single agents and the set of many-to-one stable matchings	2001-03-04	Paper
Strategy-proof allotment rules	1998-05-21	Paper
Voting under constraints	1998-01-05	Paper
Equilibrium payoffs of dynamic games	1997-02-04	Paper
Subgame perfect equilibrium of repeated games with implementation costs	1996-02-12	Paper
https://portal.mardi4nfdi.de/entity/Q4305221	1994-09-05	Paper
Little perfection and complexity	1994-01-26	Paper
Nash equilibrium strategies in repeated games with and without cost of implementation	1993-01-16	Paper
Equilibrium of repeated games with cost of implementation	1992-12-17	Paper
https://portal.mardi4nfdi.de/entity/Q3471800	1990-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4203972	1989-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3734127	1985-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3741346	1985-01-01	Paper

Research outcomes over time

This page was built for person: Alejandro Neme