The following pages link to Eric Bahel (Q328546):
Displaying 20 items.
- On the core and bargaining set of a veto game (Q328547) (← links)
- Shapley-Shubik methods in cost sharing problems with technological cooperation (Q404762) (← links)
- Optimal management of strategic reserves of nonrenewable natural resources (Q545130) (← links)
- The implications of the ranking axiom for discrete cost sharing methods (Q637583) (← links)
- Consistency requirements and pattern methods in cost sharing problems with technological cooperation (Q1621724) (← links)
- Minimum incoming cost rules for arborescences (Q1697835) (← links)
- Rock-paper-scissors and cycle-based games (Q1925644) (← links)
- Hyperadditive games and applications to networks or matching problems (Q1995312) (← links)
- Strategy-proof choice with monotonic additive preferences (Q1995472) (← links)
- Minimum coloring problems with weakly perfect graphs (Q2149192) (← links)
- Stability and fairness in the job scheduling problem (Q2273931) (← links)
- Stable cost sharing in production allocation games (Q2318129) (← links)
- A cost sharing example in which subsidies are necessary for stability (Q2334315) (← links)
- Stable lexicographic rules for shortest path games (Q2345157) (← links)
- A discrete cost sharing model with technological cooperation (Q2376076) (← links)
- Cycles with undistinguished actions and extended rock-paper-scissors games (Q2446288) (← links)
- Patent Nash equilibria in symmetric strictly competitive games (Q2659970) (← links)
- Communication and cooperation in prisoner's dilemma games (Q2673212) (← links)
- Matching markets with middlemen under transferable utility (Q6103197) (← links)
- Stable and weakly additive cost sharing in shortest path problems (Q6146452) (← links)
