The following pages link to Coordination mechanisms (Q838145):
Displaying 41 items.
- Reducing price of anarchy of selfish task allocation with more selfishness (Q393039) (← links)
- Coordination mechanisms with hybrid local policies (Q408369) (← links)
- A coordination mechanism for a scheduling game with parallel-batching machines (Q511705) (← links)
- The price of optimum: complexity and approximation for a matching game (Q521813) (← links)
- Graphical congestion games (Q639291) (← links)
- Competitive routing over time (Q719282) (← links)
- Coordination mechanisms for scheduling selfish jobs with favorite machines (Q782743) (← links)
- Coordinating action systems (Q1592481) (← links)
- Self-fulfilling signal of an endogenous state in network congestion games (Q1642952) (← links)
- Coordination mechanisms for scheduling games with proportional deterioration (Q1694911) (← links)
- Designing cost-sharing methods for Bayesian games (Q1733377) (← links)
- An almost ideal coordination mechanism for unrelated machine scheduling (Q1733383) (← links)
- Coordination mechanisms for parallel machine scheduling (Q1926738) (← links)
- Anarchy in the UJ: coordination mechanisms for minimizing the number of late jobs (Q2140265) (← links)
- Primary versus secondary infrastructure capacity allocation mechanisms (Q2158023) (← links)
- Optimal externalities in a parallel transportation network (Q2162683) (← links)
- Non-monetary coordination mechanisms for time slot allocation in warehouse delivery (Q2189884) (← links)
- Improving the price of anarchy for selfish routing via coordination mechanisms (Q2249743) (← links)
- The price of anarchy of affine congestion games with similar strategies (Q2285160) (← links)
- Improved price of anarchy for machine scheduling games with coordination mechanisms (Q2311122) (← links)
- On Stackelberg strategies in affine congestion games (Q2322708) (← links)
- A note on the lower bound for the price of anarchy of scheduling games on unrelated machines (Q2345623) (← links)
- Enforcing efficient equilibria in network design games via subsidies (Q2345938) (← links)
- Efficient coordination mechanisms for unrelated machine scheduling (Q2375956) (← links)
- The price of anarchy for utilitarian scheduling games on related machines (Q2419358) (← links)
- Approximate strong equilibria in job scheduling games with two uniformly related machines (Q2446828) (← links)
- A Stackelberg strategy for routing flow over time (Q2516242) (← links)
- Decentralized utilitarian mechanisms for scheduling games (Q2516246) (← links)
- Worst-case Nash equilibria in restricted routing (Q2637289) (← links)
- Coordination complexity: small information coordinating large populations (Q2800576) (← links)
- Designing Cost-Sharing Methods for Bayesian Games (Q2819469) (← links)
- Optimal Cost-Sharing in General Resource Selection Games (Q2957453) (← links)
- Selfish Transportation Games (Q2971133) (← links)
- Designing Networks with Good Equilibria under Uncertainty (Q5232329) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311094) (← links)
- Automata, Languages and Programming (Q5466475) (← links)
- Congestion games with priority-based scheduling (Q6049927) (← links)
- Coordination mechanisms for scheduling games with machine modification (Q6070126) (← links)
- Mixed coordination mechanisms for scheduling games on hierarchical machines (Q6070429) (← links)
- Sequential solutions in machine scheduling games (Q6620466) (← links)
- An improved upper bound for the universal TSP on the grid (Q6621749) (← links)
