Simulating cardinal preferences in Boolean games: a proof technique (Q1641024): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2795410054 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boolean Games with Epistemic Goals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Foundations of Computer Science 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equilibria problems on games: complexity versus succinctness / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Satisfiability Games and the Power of Congestion Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Rational and Irrational Nash Equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Decision Problems about Nash Equilibria in Win-Lose Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dependencies between players in Boolean games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effectivity functions and efficient coalitions in Boolean games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934593 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of Nash equilibria for \((0,1)\) bimatrix games / rank
 
Normal rank
Property / cites work
 
Property / cites work: New complexity results about Nash equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complementary pivot theory of mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5808751 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logics in Artificial Intelligence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nash and correlated equilibria: Some complexity considerations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial algorithms in linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for finding randomized strategies in game trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3457252 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-cooperative games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dependency in Cooperative Boolean Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computational Complexity of Nash Equilibria in Concisely Represented Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Enumeration and Reliability Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2892811 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3524712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3457195 / rank
 
Normal rank

Latest revision as of 22:03, 15 July 2024

scientific article
Language Label Description Also known as
English
Simulating cardinal preferences in Boolean games: a proof technique
scientific article

    Statements

    Simulating cardinal preferences in Boolean games: a proof technique (English)
    0 references
    0 references
    0 references
    14 June 2018
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references