The following pages link to Çağatay Kayı (Q404742):
Displayed 9 items.
- On the exhaustiveness of truncation and dropping strategies in many-to-many matching markets (Q404743) (← links)
- Allocation rules on networks (Q485430) (← links)
- Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems (Q844925) (← links)
- (Q2051000) (redirect page) (← links)
- School choice: Nash implementation of stable matchings through rank-priority mechanisms (Q2051001) (← links)
- Corrigendum to ``Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems'' (Q2278941) (← links)
- The core of roommate problems: size and rank-fairness within matched pairs (Q2424240) (← links)
- Equilibria under deferred acceptance: dropping strategies, filled positions, and welfare (Q2437848) (← links)
- Asymmetrically fair rules for an indivisible good problem with a budget constraint (Q2513284) (← links)