Introduction to computer science and economic theory
From MaRDI portal
Publication:2253830
DOI10.1016/j.jet.2014.11.002zbMath1314.91008OpenAlexW2009453185MaRDI QIDQ2253830
Robert D. Kleinberg, Jon M. Kleinberg, Lawrence E. Blume, David A. Easley, Éva Tardos
Publication date: 13 February 2015
Published in: Journal of Economic Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jet.2014.11.002
Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Proceedings, conferences, collections, etc. pertaining to game theory, economics, and finance (91-06)
Related Items (4)
Economic reasoning with demand and supply graphs ⋮ An introduction to mechanized reasoning ⋮ Embedding games with strategic complements into games with strategic substitutes ⋮ Pathwise smooth splittable congestion games and inefficiency
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma
- Finite automata play the repeated prisoner's dilemma
- Communication, computability, and common interest games
- The statistical mechanics of strategic interaction
- Bargaining in a network of buyers and sellers.
- On cores and indivisibility
- Multi-unit auctions: beyond Roberts
- Online ascending auctions for gradually expiring items
- Mechanism design with possibilistic beliefs
- Envy freedom and prior-free mechanism design
- Pricing lotteries
- Multilateral matching
- Approximate Nash equilibria in anonymous games
- Algorithmic rationality: game theory with costly computation
- Equilibria of dynamic games with many players: existence, approximation, and market structure
- Local smoothness and the price of anarchy in splittable congestion games
- Bounding the inefficiency of outcomes in generalized second price auctions
- An axiomatic characterization of wagering mechanisms
- Bargaining dynamics in exchange networks
- The communication requirements of efficient allocations and supporting prices
- The assignment game. I: The core
- A strategic model of social and economic networks
- On complexity as bounded rationality (extended abstract)
- Algorithmic mechanism design (extended abstract)
- Simple Adaptive Strategies
- The complexity of computing a Nash equilibrium
- On a network creation game
- The Implementation of Social Choice Rules: Some General Results on Incentive Compatibility
- Learning, Local Interaction, and Coordination
- How bad is selfish routing?
- Learning Rational Expectations Under Computability Constraints
- AdWords and generalized online matching
- Near-optimal network design with selfish agents
- Resource Allocation Under Asymmetric Information
- Manipulation of Voting Schemes: A General Result
- Effective Price Mechanisms
- Incentive Compatibility and the Bargaining Problem
- Nash Equilibrium and Welfare Optimality
- Cooperation and Effective Computability
- Communication Complexity
- Intrinsic robustness of the price of anarchy
- College Admissions and the Stability of Marriage
This page was built for publication: Introduction to computer science and economic theory
