Ghislain Fourny

Ghislain Fourny
ETH Zurich | ETH Zürich · Department of Computer Science

Dr. sc. ETH Zürich
Spending my life proving that Einstein was right about quantum theory.

About

30
Publications
9,713
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
113
Citations
Citations since 2016
18 Research Items
86 Citations
201620172018201920202021202205101520
201620172018201920202021202205101520
201620172018201920202021202205101520
201620172018201920202021202205101520
Introduction
Interested in querying large, heterogeneous, nested datasets with JSONiq. Working on the Rumble implementation. Fervent believer that Albert Einstein was right that quantum theory is not a complete description of reality and that there is an extension theory with more predictive power. Approaching the problem via non-Nashian game theory and an alternate approach to free choice: the Perfect Prediction Equilibrium, recently adapted to special relativity as the Perfectly Transparent Equilibrium.
Additional affiliations
September 2009 - December 2009
ETH Zurich
Position
  • XML and Databases (TA)
September 2008 - December 2008
ETH Zurich
Position
  • XML and Databases (TA)
April 2007 - June 2007
ETH Zurich
Position
  • Information Security (TA)
Education
March 2007 - December 2011
ETH Zurich
Field of study
  • Computer Science
September 2004 - March 2007
ETH Zurich
Field of study
  • Computer Science

Publications

Publications (30)
Article
Full-text available
This paper introduces a new solution concept for non-cooperative games in normal form with no ties and pure strategies: the Perfectly Transparent Equilibrium. The players are rational in all possible worlds and know each other’s strategies in all possible worlds – which, together, we refer to as Perfect Prediction. The anticipation of a player’s de...
Preprint
Full-text available
This paper contributes a new class of games called spacetime games with perfect information. In spacetime games, the agents make decisions at various positions in Minkowski spacetime. Spacetime games can be seen as the least common denominator of strategic games on the one hand, and dynamic games with perfect information on the other hand. Indeed,...
Article
This paper introduces Rumble, a query execution engine for large, heterogeneous, and nested collections of JSON objects built on top of Apache Spark. While data sets of this type are more and more wide-spread, most existing tools are built around a tabular data model, creating an impedance mismatch for both the engine and the query interface. In co...
Article
Full-text available
This dataset includes 204,350,000 games in normal form played by two agents that have the choice between three strategies each, as well as 100,000 games in normal form played by four agents that have the choice between three strategies each. The games are in general position, i.e., there are no ties between the outcomes for each of the agents. Thes...
Book
Full-text available
This is the textbook of my Big Data course at ETH Zurich. It is work in progress. Latest update November 22, 2022. More information at https://ghislainfourny.github.io/big-data-textbook/
Preprint
Full-text available
Lakehouse systems have reached in the past few years unprecedented size and heterogeneity and have been embraced by many industry players. However, they are often difficult to use as they lack the declarative language and optimization possibilities of relational engines. This paper introduces RumbleML, a high-level, declarative library integrated i...
Preprint
Full-text available
In this work, we design a novel game-theoretical framework capable of capturing the defining aspects of quantum theory. We introduce an original model and an algorithmic procedure that enables to express measurement scenarios encountered in quantum mechanics as multiplayer games and to translate physical notions of causality, correlation, and conte...
Article
In the domain of high-energy physics (HEP), query languages in general and SQL in particular have found limited acceptance. This is surprising since HEP data analysis matches the SQL model well: the data is fully structured and queried using mostly standard operators. To gain insights on why this is the case, we perform a comprehensive analysis of...
Preprint
Full-text available
In this letter, we point to three widely accepted challenges that the quantum theory, quantum information, and quantum foundations communities are currently facing: indeterminism, the semantics of conditional probabilities, and the spooky action at a distance. We argue that these issues are fundamentally rooted in conflations commonly made between...
Preprint
Full-text available
In this letter, we point to three widely accepted challenges that the quantum theory, quantum information, and quantum foundations communities are currently facing: indeterminism, the semantics of conditional probabilities, and the spooky action at a distance. We argue that these issues are fundamentally rooted in conflations commonly made between...
Preprint
Full-text available
Query languages in general and SQL in particular are arguably one of the most successful programming interfaces. Yet, in the domain of high-energy physics (HEP), they have found limited acceptance. This is surprising since data analysis in HEP matches the SQL model well: it is fully structured data queried using combinations of selections, projecti...
Preprint
Full-text available
This paper introduces Rumble, an engine that executes JSONiq queries on large, heterogeneous and nested collections of JSON objects, leveraging the parallel capabilities of Spark so as to provide a high degree of data independence. The design is based on two key insights: (i) how to map JSONiq expressions to Spark transformations on RDDs and (ii) h...
Preprint
Full-text available
The non-extensibility of quantum theory into an extended theory with improved predictive power is based on a strong assumption of independent free choice, in which the physicists pick a measurement axis independently of anything that couldn't have been caused by their decision. Independent free choice is also at the core of the Nash equilibrium and...
Preprint
Full-text available
The assumptions of necessary rationality and necessary knowledge of strategies, also known as perfect prediction, lead to at most one surviving outcome, immune to the knowledge that the players have of them. Solutions concepts implementing this approach have been defined on both dynamic games with perfect information, the Perfect Prediction Equilib...
Preprint
Full-text available
The Perfectly Transparent Equilibrium is algorithmically defined, for any game in normal form with perfect information and no ties, as the iterated deletion of non-individually-rational strategy profiles until at most one remains. In this paper, we characterize the Perfectly Transparent Equilibrium with adapted Kripke models having necessary ration...
Preprint
Full-text available
This paper shows that, for symmetric games in normal form, strategy profiles that satisfy Hofstadter's Superrationality criterion also satisfy both of Halpern's criteria under Common Counterfactual Belief of Rationality: minimax-rationalizability and individual rationality.
Preprint
Full-text available
The Nash equilibrium paradigm, and Rational Choice Theory in general , rely on agents acting independently from each other. This note shows how this assumption is crucial in the definition of Rational Choice Theory. It explains how a consistent Alternate Rational Choice Theory, as suggested by Jean-Pierre Dupuy, can be built on the exact opposite a...
Preprint
Full-text available
This paper introduces a binary encoding that supports arbitrarily large, small and precise decimals. It completely preserves information and order. It does not rely on any arbitrary use-case-based choice of calibration and is readily implementable and usable, as is. Finally, it is also simple to explain and understand.
Preprint
Full-text available
Cell stores provide a relational-like, tabular level of abstraction to business users while leveraging recent database technologies, such as key-value stores and document stores. This allows to scale up and out the efficient storage and retrieval of highly dimensional data. Cells are the primary citizens and exist in different forms, which can be e...
Preprint
Full-text available
In the framework of finite games in extensive form with perfect information and strict preferences, this paper introduces a new equilibrium concept under the assumption of total transparency: all players share the same knowledge and know as much as an omniscient external observer. In particular, there is common knowledge of the solution of the game...
Article
After 40 years of relational databases and of cohabitation between flat tables and object-oriented programming, a new generation of data stores is emerging. Sometimes referred to as NoSQL, this new generation supports hierarchical, heterogeneous data such as XML, JavaScript Object Notation, and Binary JSON. While the abstract querying primitives of...
Technical Report
Full-text available
With sinking storage costs, it becomes more and more fea-sible, and popular, to retain past versions of documents and data. While undoing changes is worthy, this becomes even more valuable if the data is queryable. Nowadays, there are two widespread version control paradigms: document versioning (SVN, git, etc.) and versioned databases. The former...
Conference Paper
Full-text available
As storage-main memory as well as disk-becomes cheaper, the amount of available information is increasing and it is a challenge to organize it. Our broader aim is to provide a unified framework for efficiently versioning and querying data, documents, as well as any kind of semi-structured information between data and documents, which can be stored...
Conference Paper
Full-text available
Since the invention of the Web, the browser has become more and more powerful. By now, it is a programming and execution environment in itself. The predominant language to program applications in the browser today is JavaScript. With browsers becoming more powerful, JavaScript has been extended and new layers have been added (e.g., DOM-Sup- port an...
Conference Paper
Over the years, the browser has become a complete runtime environment for client-side programs. The main scripting language used towards this purpose is JavaScript, which was designed so as to program the browser. A lot of extensions and new layers have been built on top of it to allow e.g. DOM navigation and manipulation. However, JavaScript has b...

Network

Cited By

Projects

Projects (3)
Archived project
Time travel queries for XQuery
Project
A declarative, functional language tailored for JSON.
Project
Many equilibria in game theory are refinements of the well-established Nash equilibrium. Many people think "the Nash way,"​ in other words, are rational. Yet, the Nash paradigm doesn't account for all our actions, in particular, it can't explain why we keep our promises with no further incentive. So, are we irrational when we do so? As Newcomb's problem points out, there are two mindsets of rationality. There are two ways of being rational, and both ways are reasonable. For games in extensive form, the Nash Subgame Perfect Equilibrium models one of the two. In this paradigm, players assume that they can pick their strategies independently of their opponents. Another approach to rationality assumes, on the contrary, that a player will consider the reaction of her opponents to any change in strategy. We built the Perfect Prediction Equilibrium to model this kind of rationality for games in extensive form. The Perfect Prediction Equilibrium can also be put in perspective with Douglas Hofstadter's work on Superrationality for symmetric games in normal form, which is different from the Nash Equilibrium in the same way that the PPE and SPE are different. The PPE is also known as the Projected Equilibrium. This research was started by Dupuy with an initial publication under this name in 2000, stating a conjecture of existence, uniqueness and Pareto-optimality. It has since then been formalized and proven (2004) and shared online (2014) after receiving a lot of useful feedback from the community. The take-home message? It is also rational to be honest, and it is even socially beneficial (in the Pareto sense).