human: Given a node-centered hypergraph: <hypergraph>, where nodes represent authors and hyperedges represent groups of authors who co-authored the same paper.

Details of the hypergraph:
Center node: "Congestion Games with Higher Demand Dimensions"
  Abstract: We introduce a generalization of weighted congestion games in which players are associated with k-dimensional demand vectors and resource costs are k-dimensional functions \(\smash{c : \mathbb{R}_{\geq 0}^k \to \mathbb{R}}\) of the aggregated demand vector of the players using the resource. Such a cost structure is natural when the cost of a resource depends on different properties of the players’ demands, e.g., total weight, total volume, and total number of items. A complete characterization of the existence of pure Nash equilibria in terms of the resource cost functions for all k ∈ ℕ is given.

Connected through hyperedge HE-1 (induced by source paper "Selfish unsplittable flows"):
  with members:
    - "A New Model for Selfish Routing"
    - "On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games"

Question: Please tell me which research area the center author belongs to. The 4 classes are: Computer science, Mathematics, Engineering, Economics, Psychology, Business. Directly output the class name.

gpt: Psychology