Introduction to computer science and economic theory
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 42696
- Computation as economics
- On the role of computation in economic theory
- scientific article; zbMATH DE number 108595
- scientific article; zbMATH DE number 108584
- Computability and economic planning
- Computability, complexity and economics
- Computability and algorithmic complexity in economics
Cites work
- A strategic model of social and economic networks
- AdWords and generalized online matching
- Algorithmic mechanism design (extended abstract)
- Algorithmic rationality: game theory with costly computation
- An axiomatic characterization of wagering mechanisms
- Approximate Nash equilibria in anonymous games
- Bargaining dynamics in exchange networks
- Bargaining in a network of buyers and sellers.
- Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma
- Bounding the inefficiency of outcomes in generalized second price auctions
- College Admissions and the Stability of Marriage
- Communication Complexity
- Communication, computability, and common interest games
- Computational aspects of prediction markets
- Cooperation and Effective Computability
- Effective Price Mechanisms
- Envy freedom and prior-free mechanism design
- Equilibria of dynamic games with many players: existence, approximation, and market structure
- Finite automata play the repeated prisoner's dilemma
- How bad is selfish routing?
- scientific article; zbMATH DE number 4207454 (Why is no real title available?)
- scientific article; zbMATH DE number 3215724 (Why is no real title available?)
- scientific article; zbMATH DE number 3402334 (Why is no real title available?)
- scientific article; zbMATH DE number 3069635 (Why is no real title available?)
- Incentive Compatibility and the Bargaining Problem
- Intrinsic robustness of the price of anarchy
- Learning Rational Expectations Under Computability Constraints
- Learning, Local Interaction, and Coordination
- Local smoothness and the price of anarchy in splittable congestion games
- Manipulation of Voting Schemes: A General Result
- Mechanism design with possibilistic beliefs
- Multi-unit auctions: beyond Roberts
- Multilateral matching
- Nash Equilibrium and Welfare Optimality
- Near-optimal network design with selfish agents
- On a network creation game
- On complexity as bounded rationality (extended abstract)
- On cores and indivisibility
- Online ascending auctions for gradually expiring items
- Pricing lotteries
- Resource Allocation Under Asymmetric Information
- Simple adaptive strategies. From regret-matching to uncoupled dynamics. With the collaboration of Yakov Babichenko, Amotz Cahn, Yishay Mansour and David Schmeidler
- The assignment game. I: The core
- The communication requirements of efficient allocations and supporting prices
- The complexity of computing a Nash equilibrium
- The Implementation of Social Choice Rules: Some General Results on Incentive Compatibility
- The statistical mechanics of strategic interaction
Cited in
(8)- Computational economics and economic theory: Substitutes or complements?
- Embedding games with strategic complements into games with strategic substitutes
- Economic reasoning with demand and supply graphs
- Computer science and decision theory
- Pathwise smooth splittable congestion games and inefficiency
- scientific article; zbMATH DE number 108595 (Why is no real title available?)
- scientific article; zbMATH DE number 1118016 (Why is no real title available?)
- An introduction to mechanized reasoning
This page was built for publication: Introduction to computer science and economic theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2253830)
