[go: up one dir, main page]

Bonanno, 2004 - Google Patents

A characterization of von neumann games in terms of memory

Bonanno, 2004

View PDF
Document ID
1392057845298345575
Author
Bonanno G
Publication year
Publication venue
Synthese

External Links

Snippet

An information completion of an extensive game is obtained by extending the information partition of every player from the set of her decision nodes to the set of all nodes. The extended partition satisfies Memory of Past Knowledge (MPK) if at any node a player …
Continue reading at escholarship.org (PDF) (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
    • G06F17/30958—Graphs; Linked lists
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for programme control, e.g. control unit
    • G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
    • G06F9/44—Arrangements for executing specific programmes
    • G06F9/4421—Execution paradigms
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G06F17/5045—Circuit design
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N5/00—Computer systems utilising knowledge based models
    • G06N5/02—Knowledge representation
    • G06N5/022—Knowledge engineering, knowledge acquisition
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N5/00—Computer systems utilising knowledge based models
    • G06N5/04—Inference methods or devices
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/20—Handling natural language data
    • G06F17/27—Automatic analysis, e.g. parsing
    • G06F17/2705—Parsing
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N99/00—Subject matter not provided for in other groups of this subclass
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F8/00—Arrangements for software engineering
    • G06F8/40—Transformations of program code
    • G06F8/41—Compilation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00—Computer systems based on biological models
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management

Similar Documents

Publication Publication Date Title
Soeken et al. The EPFL logic synthesis libraries
Kupferman et al. Safraless decision procedures
Henzinger et al. Solving games without determinization
McMillan Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits
Safra Complexity of automata on infinite objects
Sakamoto et al. Intractability of decision problems for finite-memory automata
Camacho et al. Finite LTL Synthesis with Environment Assumptions and Quality Measures.
Mateescu et al. AND/OR multi-valued decision diagrams (AOMDDs) for graphical models
Godefroid et al. LTL generalized model checking revisited
Finkbeiner et al. Synthesis in distributed environments
Grumberg et al. Learning to order BDD variables in verification
Loader Notes on simply typed lambda calculus
Eiter et al. Domain expansion for ASP-programs with external sources.
Hamez et al. Hierarchical set decision diagrams and automatic saturation
Hao et al. Evolutionary computing for the satisfiability problem
Bonanno A characterization of von neumann games in terms of memory
Liberatore The complexity of the language A
Aminof et al. Synthesis of hierarchical systems
Freeman Parallel algorithms for depth-first search
Dixon et al. Clausal resolution for logics of time and knowledge with synchrony and perfect recall
Hung Implementation and performance of Transaction Logic in Prolog.
Goranko et al. Tableau-based decision procedure for the multi-agent epistemic logic with operators of common and distributed knowledge
Galimullin et al. Changing the Rules of the Game: Reasoning about Dynamic Phenomena in Multi-Agent Systems
Gunawardena Periodic behaviour in timed systems with fAND; ORg causality. Part I: systems of dimension 1 and 2
Ternovska Towards Capturing PTIME with no Counting Construct (but with a Choice Operator)