Inverse Game Theory: Learning Utilities in Succinct Games
From MaRDI portal
Publication:3460806
DOI10.1007/978-3-662-48995-6_30zbMath1404.91059OpenAlexW2404673495MaRDI QIDQ3460806
Volodymyr Kuleshov, Okke Schrijvers
Publication date: 8 January 2016
Published in: Web and Internet Economics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-48995-6_30
Related Items (3)
Using inverse optimization to learn cost functions in generalized Nash games ⋮ Evaluating Strategic Structures in Multi-Agent Inverse Reinforcement Learning ⋮ Response prediction for low-regret agents
Cites Work
- Unnamed Item
- The Nonparametric Approach to Demand Analysis
- Empirical models of discrete games
- Calibrated learning and correlated equilibrium
- Estimating a game theoretic model
- A class of games possessing pure-strategy Nash equilibria
- The complexity of computing a Nash equilibrium
- Identification and Estimation of a Discrete Game of Complete Information
- The Price of Stability for Network Design with Fair Cost Allocation
- Settling the complexity of computing two-player Nash equilibria
- The Complexity of Rationalizing Matchings
- Inverse Optimization
- A Simple Adaptive Procedure Leading to Correlated Equilibrium
- The Complexity of Rationalizing Network Formation
- Selfish caching in distributed systems
- Equilibria of Polymatrix Games
- The Construction of Utility Functions from Expenditure Data
- Computing correlated equilibria in multi-player games
This page was built for publication: Inverse Game Theory: Learning Utilities in Succinct Games