human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "prior independent equilibria and linear multi dimensional bayesian games"):
  Abstract: We show that a Bayesian strategy map profile is a Bayesian Nash Equilibrium independent of any prior if and only if the Bayesian strategy map profile, evaluated at any type profile, is the Nash equilibrium of the so-called local deterministic game corresponding to that type profile. We call such a Bayesian game type-regular. We then show that an m-dimensional n-agent Bayesian game whose utilities are linearly dependent on the types of the agents is equivalent, following a normalisation of the type space of each agent into the (m-1)-simplex, to a simultaneous competition in nm so-called basic n-agent games. If the game is own-type-linear, i.e., the utility of each player only depends linearly on its own type, then the Bayesian game is equivalent to a simultaneous competition in m basic n-agent games, called a multi-game. We then prove that an own-type-linear Bayesian game is type-regular if it is type-regular on the vertices of the (m-1)-simplex, a result which provides a large class of type-regular Bayesian maps. The class of m-dimensional own-type-linear Bayesian games can model, via their equivalence with multi-games, simultaneous decision-making in m different environments. We show that a two dimensional own-type-linear Bayesian game can be used to give a new model of the Prisoner's Dilemma (PD) in which the prosocial tendencies of the agents are considered as their types and the two agents play simultaneously in the PD as well as in a prosocial game. This Bayesian game addresses the materialistic and the prosocial tendencies of the agents. Similarly, we present a new two dimensional Bayesian model of the Trust game in which the type of the two agents reflect their prosocial tendency or trustfulness, which leads to more reasonable Nash equilibria. We finally consider an example of such multi-environment decision making in production by several companies in multi-markets.

Includes members:
  Member "network cournot competition":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "governance of social welfare in networked markets")
  Member "graphical models for game theory":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "complexity theory game theory and economics the barbados lectures")
  Member "prior independent auctions for risk averse agents":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimal auctions vs anonymous pricing beyond linear utility")
  Member "multi games and a double game extension of the prisoner s dilemma":
    also connected through other hyperedges:
      (none)
  Member "the robust price of anarchy of altruistic games":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "online best reply algorithms for resource allocation problems")
  Member "price of anarchy for greedy auctions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "proportional dynamics in exchange economies")

Question: Please tell me which class the source paper belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.GT(Computer Science and Game Theory)