Pages that link to "Item:Q5466475"
From MaRDI portal
The following pages link to Automata, Languages and Programming (Q5466475):
Displaying 34 items.
- Nonpreemptive coordination mechanisms for identical machines (Q372964) (← links)
- Extending the notion of rationality of selfish agents: second order Nash equilibria (Q533871) (← links)
- Non-clairvoyant scheduling games (Q647492) (← links)
- Game-theoretic analysis of Internet switching with selfish users (Q714792) (← links)
- Randomized truthful algorithms for scheduling selfish tasks on parallel machines (Q764300) (← links)
- On the Price of Anarchy of cost-sharing in real-time scheduling systems (Q777962) (← links)
- Strong equilibrium in cost sharing connection games (Q834855) (← links)
- The impact of local policies on the quality of packet routing in paths, trees, and rings (Q835620) (← links)
- Coordination mechanisms (Q838145) (← links)
- Truthful algorithms for scheduling selfish tasks on parallel machines (Q861258) (← links)
- Decentralized subcontractor scheduling with divisible jobs (Q892907) (← links)
- Cost sharing mechanisms for fair pricing of resource usage (Q943873) (← links)
- Non-cooperative cost sharing games via subsidies (Q987398) (← links)
- Price of anarchy in parallel processing (Q991788) (← links)
- Coordination mechanisms for selfish scheduling (Q1014630) (← links)
- On truthfulness and approximation for scheduling selfish tasks (Q1041343) (← links)
- Scheduling without payments (Q1678760) (← links)
- On the price of anarchy of two-stage machine scheduling games (Q2051911) (← links)
- Multistage interval scheduling games (Q2283299) (← links)
- Decentralized beneficiary behavior in humanitarian supply chains: models, performance bounds, and coordination mechanisms (Q2288975) (← links)
- Selfish load balancing for jobs with favorite machines (Q2294253) (← links)
- The shortest first coordination mechanism for a scheduling game with parallel-batching machines (Q2361588) (← links)
- Inefficiency of Nash equilibria with parallel processing policy (Q2444737) (← links)
- Coordinating oligopolistic players in unrelated machine scheduling (Q2514126) (← links)
- Coordination Mechanisms for Selfish Parallel Jobs Scheduling (Q2898033) (← links)
- Bounds for the Convergence Time of Local Search in Scheduling Problems (Q2959840) (← links)
- Mechanisms with Monitoring for Truthful RAM Allocation (Q3460805) (← links)
- Plan-Coordination Mechanisms and the Price of Autonomy (Q3602938) (← links)
- A Coordination Mechanism for a Scheduling Game with Uniform-Batching Machines (Q4689392) (← links)
- (Q5009585) (← links)
- Minimizing Maximum Flow Time on Related Machines via Dynamic Posted Pricing (Q5111740) (← links)
- Approximate Strong Equilibrium in Job Scheduling Games (Q5459972) (← links)
- Non-cooperative Cost Sharing Games Via Subsidies (Q5459998) (← links)
- Scheduling games with machine-dependent priority lists (Q5896089) (← links)
