The following pages link to Alejandro Neme (Q427508):
Displaying 38 items.
- The division problem with voluntary participation (Q427509) (← links)
- On cooperative solutions of a generalized assignment game: limit theorems to the set of competitive equilibria (Q472191) (← links)
- The blocking lemma for a many-to-one matching model (Q617603) (← links)
- On societies choosing social outcomes, and their memberships: internal stability and consistency (Q683523) (← links)
- Maximal domain of preferences in the division problem (Q700081) (← links)
- On the invariance of the set of core matchings with respect to preference profiles (Q765218) (← links)
- Stable partitions in many division problems: the proportional and the sequential dictator solutions (Q892978) (← links)
- Equilibrium of repeated games with cost of implementation (Q1196196) (← links)
- Nash equilibrium strategies in repeated games with and without cost of implementation (Q1200774) (← links)
- Little perfection and complexity (Q1313357) (← links)
- Strategy-proof allotment rules (Q1367676) (← links)
- Voting under constraints (Q1371133) (← links)
- An algorithm to compute the full set of many-to-many stable matchings. (Q1431789) (← links)
- Single agents and the set of many-to-one stable matchings (Q1566906) (← links)
- On societies choosing social outcomes, and their memberships: strategy-proofness (Q1704055) (← links)
- A maximal domain of preferences for strategy-proof, efficient, and simple rules in the division problem (Q1762856) (← links)
- Stability and voting by committees with exit (Q1762858) (← links)
- Subgame perfect equilibrium of repeated games with implementation costs (Q1906462) (← links)
- The multiple-partners assignment game with heterogeneous sales and multi-unit demands: competitive equilibria (Q1935950) (← links)
- Effort of rugby teams according to the bonus point system: a theoretical and empirical analysis (Q2041078) (← links)
- Order-\(k\) rationality (Q2143893) (← links)
- On obvious strategy-proofness and single-peakedness (Q2295829) (← links)
- On the structure of cooperative and competitive solutions for a generalized assignment game (Q2336206) (← links)
- The division problem under constraints (Q2345235) (← links)
- Equilibrium payoffs of dynamic games (Q2365093) (← links)
- An undominated Nash equilibrium for voting by committees with exit (Q2384877) (← links)
- Maximal domains of preferences preserving strategy-proofness for generalized median voter schemes (Q2386317) (← links)
- Bribe-proof rules in the division problem (Q2462290) (← links)
- On the invariance of the set of stable matchings with respect to substitutable preference profiles (Q2482670) (← links)
- Voting by committees under constraints (Q2485953) (← links)
- STABLE SOLUTIONS ON MATCHING MODELS WITH QUOTA RESTRICTION (Q2883138) (← links)
- (Q3471800) (← links)
- (Q3734127) (← links)
- (Q3741346) (← links)
- (Q4203972) (← links)
- (Q4305221) (← links)
- On the lattice structure of the set of stable matchings for a many-to-one model<sup>∗</sup> (Q4531544) (← links)
- All sequential allotment rules are obviously strategy‐proof (Q6076917) (← links)
