The following pages link to Panagiota N. Panagopoulou (Q943872):
Displaying 16 items.
- Cost sharing mechanisms for fair pricing of resource usage (Q943873) (← links)
- Polynomial algorithms for approximating Nash equilibria of bimatrix games (Q1014631) (← links)
- Random bimatrix games are asymptotically easy to solve (a simple proof) (Q1678770) (← links)
- (Q2348038) (redirect page) (← links)
- On the structure of equilibria in basic network formation (Q2348039) (← links)
- On the Structure of Equilibria in Basic Network Formation (Q2842790) (← links)
- Random Bimatrix Games Are Asymptotically Easy to Solve (A Simple Proof) (Q3095273) (← links)
- Rationality Authority for Provable Rational Behavior (Q3464466) (← links)
- Efficient Equilibrium Concepts in Non-cooperative Network Formation (Q3464483) (← links)
- Algorithms for pure Nash equilibria in weighted congestion games (Q3507775) (← links)
- Selfish Load Balancing Under Partial Knowledge (Q3525605) (← links)
- A Game Theoretic Approach for Efficient Graph Coloring (Q3596717) (← links)
- Playing a Game to Bound the Chromatic Number (Q4923951) (← links)
- Potential Functions in Strategic Games (Q4928493) (← links)
- Full and Local Information in Distributed Decision Making (Q5443380) (← links)
- Experimental and Efficient Algorithms (Q5710018) (← links)
