The following pages link to On the complexity of equilibria (Q3579177):
Displaying 12 items.
- Buyer-supplier games: optimization over the core (Q627118) (← links)
- A primal-dual algorithm for computing Fisher equilibrium in the absence of gross substitutability property (Q883995) (← links)
- Walrasian equilibrium: Hardness, approximations and tractable instances (Q943867) (← links)
- The computation of approximate competitive equilibrium is PPAD-hard (Q975493) (← links)
- The complexity of economic equilibria for house allocation markets (Q1029018) (← links)
- On complexity of single-minded auction (Q1765304) (← links)
- A path to the Arrow-Debreu competitive market equilibrium (Q2467155) (← links)
- Approximate competitive equilibrium with generic budget (Q2670929) (← links)
- Incentive ratio: a game theoretical analysis of market equilibria (Q2672255) (← links)
- Computing the Deficiency of Housing Markets with Duplicate Houses (Q3058693) (← links)
- A Simplex-Like Algorithm for Fisher Markets (Q3162504) (← links)
- A Truthful Mechanism for Offline Ad Slot Scheduling (Q5459983) (← links)