The following pages link to (Q3524726):
Displaying 17 items.
- Design of automated negotiation mechanisms for decentralized heterogeneous machine scheduling (Q320651) (← links)
- Repeated congestion games with bounded rationality (Q444148) (← links)
- Price of anarchy for highly congested routing games in parallel networks (Q1733382) (← links)
- Preferences and the price of stability in matching markets (Q1945450) (← links)
- Price of Pareto optimality in hedonic games (Q2046008) (← links)
- Delegation and ambiguity in correlated equilibrium (Q2078094) (← links)
- Simultaneous auctions without complements are (almost) efficient (Q2206818) (← links)
- Equilibria in multi-player multi-outcome infinite sequential games (Q2225601) (← links)
- The duality gap for two-team zero-sum games (Q2416652) (← links)
- What price stability? Social welfare in matching markets (Q2446689) (← links)
- A parametric worst-case approach to fairness in cooperative games with transferable utility (Q2699972) (← links)
- On the Price of Anarchy of Highly Congested Nonatomic Network Games (Q2819452) (← links)
- Inefficiency of Nash Equilibria (Q3722301) (← links)
- (Q4638111) (← links)
- Dynamic Atomic Congestion Games with Seasonal Flows (Q4969328) (← links)
- Selfishness Need Not Be Bad (Q4994166) (← links)
- Bertrand Competition in Networks (Q5459973) (← links)