相关论文: Equilibria of Chinese Auctions

Quantum game theory has emerged as a promising candidate to further the understanding of quantum correlations. Motivated by this, it is demonstrated that pure strategy Nash equilibria can be utilised as a mechanism to witness and determine…

We address the equilibrium concept of a reverse auction game so that no one can enhance the individual payoff by a unilateral change when all the others follow a certain strategy. In this approach the combinatorial possibilities to consider…

A description of static equilibria in the noisy binary choice (Ising) game on complete and random graphs resulting from maximisation of the likelihood of system configurations is presented. An equivalence of such likelihood equilibria to…

We consider a class of N-player stochastic games of multi-dimensional singular control, in which each player faces a minimization problem of monotone-follower type with submodular costs. We call these games "monotone-follower games". In a…

In non-truthful auctions such as first-price and all-pay auctions, the independent strategic behaviors of bidders, with the corresponding Bayes-Nash equilibrium notion, are notoriously difficult to characterize and can cause undesirable…

While it is known that shared quantum entanglement can offer improved solutions to a number of purely cooperative tasks for groups of remote agents, controversy remains regarding the legitimacy of quantum games in a competitive setting--in…

In game theory, the concept of Nash equilibrium reflects the collective stability of some individual strategies chosen by selfish agents. The concept pertains to different classes of games, e.g. the sequential games, where the agents play…

This paper proposes a novel energy sharing mechanism for prosumers who can produce and consume. Different from most existing works, the role of individual prosumer as a seller or buyer in our model is endogenously determined. Several…

The standard game-theoretic solution concept, Nash equilibrium, assumes that all players behave rationally. If we follow a Nash equilibrium and opponents are irrational (or follow strategies from a different Nash equilibrium), then we may…

Computational aspects of solution notions such as Nash equilibrium have been extensively studied, including settings where the ultimate goal is to find an equilibrium that possesses some additional properties. Furthermore, in order to…

In the traditional game-theoretic set up, where agents select actions and experience corresponding utilities, an equilibrium is a configuration where no agent can improve their utility by unilaterally switching to a different action. In…

In this paper, I prove that existence of pure-strategy Nash equilibrium in games with infinitely many players is equivalent to the axiom of choice.

In Zeng et al. [Fluct. Noise Lett. 7 (2007) L439--L447] the analysis of the lowest unique positive integer game is simplified by some reasonable assumptions that make the problem tractable for arbitrary numbers of players. However, here we…

We study the classic divide-and-choose method for equitably allocating divisible goods between two players who are rational, self-interested Bayesian agents. The players have additive values for the goods. The prior distributions on those…

We consider the problem in which n items arrive to a market sequentially over time, where two agents compete to choose the best possible item. When an agent selects an item, he leaves the market and obtains a payoff given by the value of…

This paper studies a nonzero-sum Dynkin game in discrete time under non-exponential discounting. For both players, there are two levels of game-theoretic reasoning intertwined. First, each player looks for an intra-personal equilibrium…

Quasiliearity is a ubiquitous and questionable assumption in the standard study of Walrasian equilibria. Quasilinearity implies that a buyer's value for goods purchased in a Walrasian equilibrium is always additive with goods purchased with…

Combinatorial auctions are used to allocate resources in domains where bidders have complex preferences over bundles of goods. However, the behavior of bidders under different payment rules is not well understood, and there has been limited…

We propose local symplectic surgery, a two-timescale procedure for finding local Nash equilibria in two-player zero-sum games. We first show that previous gradient-based algorithms cannot guarantee convergence to local Nash equilibria due…

Establishing the existence of Nash equilibria for partially observed stochastic dynamic games is known to be quite challenging, with the difficulties stemming from the noisy nature of the measurements available to individual players…