On the complexity of cooperative solution concepts
Mathematics of Operations Research
On complexity as bounded rationality (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Combinatorial optimization games
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Competitive auctions and digital goods
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Road Ahead
Market Equilibrium via a Primal-Dual-Type Algorithm
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
On the complexity of price equilibria
Journal of Computer and System Sciences - STOC 2002
Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time
Journal of the ACM (JACM)
A Polynomial Time Algorithm for Computing the Arrow-Debreu Market Equilibrium for Linear Utilities
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
The computation of market equilibria
ACM SIGACT News
On algorithms for discrete and approximate brouwer fixed points
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
On the Complexity of Two-PlayerWin-Lose Games
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Leontief economies encode nonzero sum two-player games
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
The complexity of computing a Nash equilibrium
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Settling the Complexity of Two-Player Nash Equilibrium
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Computing Nash Equilibria: Approximation and Smoothed Complexity
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
The approximation complexity of win-lose games
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Polynomial algorithms for approximating nash equilibria of bimatrix games
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
A note on approximate nash equilibria
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Exchange market equilibria with leontief’s utility: freedom of pricing leads to rationality
WINE'05 Proceedings of the First international conference on Internet and Network Economics
The game world is flat: the complexity of nash equilibria in succinct games
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
| Hi-index | 0.00 |
We focus on the opportunity the Internet has provided for a fully operational Economic Theory. We should review a few of the current development of the algorithmic approach in its study and postulate on the important issues that lie ahead of us.