The following pages link to Algorithmic Game Theory (Q5432685):
Displayed 21 items.
- Pareto Efficiency and Approximate Pareto Efficiency in Routing and Load Balancing Games (Q3162508) (← links)
- AN EFFICIENT AND INFORMATION THEORETICALLY SECURE RATIONAL SECRET SHARING SCHEME BASED ON SYMMETRIC BIVARIATE POLYNOMIALS (Q3173477) (← links)
- A Unified Framework for Strong Price of Anarchy in Clustering Games (Q3449509) (← links)
- Further Results on Capacitated Network Design Games (Q3449582) (← links)
- Towards More Practical Linear Programming-Based Techniques for Algorithmic Mechanism Design (Q3449585) (← links)
- Characterization and Computation of Equilibria for Indivisible Goods (Q3449598) (← links)
- Generalized Hypergraph Matching via Iterated Packing and Local Ratio (Q3453296) (← links)
- Online Allocation and Pricing with Economies of Scale (Q3460785) (← links)
- Rationality Authority for Provable Rational Behavior (Q3464466) (← links)
- On the Complexity of Equilibria Problems in Angel-Daemon Games (Q3511310) (← links)
- Non-preemptive Coordination Mechanisms for Identical Machine Scheduling Games (Q3511399) (← links)
- Selection functions, bar recursion and backward induction (Q3559969) (← links)
- When Analysis Fails: Heuristic Mechanism Design via Self-correcting Procedures (Q3599064) (← links)
- $\mathcal{NP}$ -Hardness of Pure Nash Equilibrium in Scheduling and Connection Games (Q3599089) (← links)
- When Ignorance Helps: Graphical Multicast Cost Sharing Games (Q3599119) (← links)
- From Graph Theory to Models of Economic Networks. A Tutorial (Q3606076) (← links)
- GTES : une méthode de simulation par jeux et apprentissage pour l'analyse des systèmes d'acteurs (Q3644817) (← links)
- Hats, auctions and derandomization (Q5252259) (← links)
- The Price of Stochastic Anarchy (Q5459995) (← links)
- “Beat-Your-Rival” Routing Games (Q5899478) (← links)
- Bounds on the welfare loss from moral hazard with limited liability (Q5964694) (← links)