Data-free quantization (DFQ) recovers the performance of quantized network (Q) without accessing real data, but generates fake sample via a generator (G) by learning from full-precision (P) instead. However, such generation process is totally independence Q, specialized as failing to consider adaptability generated samples, i.e., beneficial or adversarial, over resulting into non-ignorable loss...

Game theory is a huge area of mathematical (and economical) research. We restrict ourselves mainly to two person zero-sum games, in which you make a decision and your opponent makes a decision (no cooperation allowed!), and your winnings equal your opponents loss. The main result is the so-called minimax theorem. Essentially, game theory is about playing against a (possibly) better player and e...

We have seen that Nash equilibria in two-player zero-sum games (and generalizations thereof) are polynomial-time tractable from a centralized computation perspective. We have also seen that the payoff matrix of a zero-sum game determines a unique value for the row player and a unique value for the column player (summing to zero), which specify their payoffs in all equilibria of the game. In thi...

While the idea of a matching pennies game may seem contrived, it is merely the simplest example of a general class of zero-sum games, where the total payoff of the players is constant regardless of the outcome. Consequently gains for one player can only come from losses of the other. For this reason, zero-sum games will rarely have a pure strategy Nash equilibrium. Examples would be chess, or m...

An inspection game is here a non-cooperative two-person-game between an inspector and an inspectee. It models a situation where the inspector controls the inspectee who has an incentive to violate certain legal obligations. A recent survey of inspection games applied to data verification, for example in nuclear material safeguards, is given in [1]. Dresher [2] described a sequential inspection ...

The linear quadratic zero-sum dynamic game for discrete time descriptor systems is considered. A method, which involves solving a linear quadratic zero-sum dynamic game for a reduced-order discrete time state space system, is developed to nd the linear feedback saddle-point solutions of the problem. Checkable conditions, which are described in terms of two dual algebraic Riccati equations and a...

We study the complexity of solving succinct zero-sum games, i.e., the games whose payoff matrix M is given implicitly by a Boolean circuit C such that M(i, j) = C(i, j). We complement the known EXP-hardness of computing the exact value of a succinct zero-sum game by several results on approximating the value. (1) We prove that approximating the value of a succinct zero-sum game to within an add...

Matching Pennies is a well-known example of a two player, zero-sum game. In this game, each of the players, the matcher and the mismatcher, flips a coin, and the payoffs are determined as follows. If the coins come up matching (i.e., both heads or both tails), then the matcher wins, so the mismatcher pays the matcher the sum of $1. If the coins do not match (i.e., one head and one tail), then t...

1 Summary We discuss strategies in non-zero sum games of perfect information on graphs. The study of non-zero sum games on graphs is motivated by the advent of computational tasks on the worldwide web and related security requirements which have thrown up many interesting areas of interaction between game theory and computer science. For example, signing contracts on the web requires interactio...