全支付拍卖模型的信息结构及其对均衡的影响分析

研究全支付拍卖模型中参与人的参与结构以及均衡问题.首先给出了非对称信息下参与人的参与选择问题,分析了异质参与人的参与选择.尔后给出了参与人参与均衡策略,给出当参与人估价分布函数在对称和非对称情形时,竞赛中的对称均衡策略.最后给出了当均衡存在时,竞争对手对均衡分布函数的估计.     

一类新广义博弈的均衡存在性

假定博弈参与人策略选择影响着博弈参与人的情绪,从而影响到参与人的支付函数.在这样的假定下,引入一类新的广义博弈问题,并且给出相应均衡的定义.进一步,在一定条件下,证明了这些均衡的存在性,并给出这些均衡之间的关系.最后给出一个简单算例,验证了其可行性.     

幼稚产业保护中的动态博弈分析

本文建立了A国政府、A国幼稚产业与B国产业三个参与人的幼稚产业保护动态博弈模型,分析了其博弈的顺序、参与人的策略集合及支付函数,按照逆向归纳法的思想给出了子博弈精练均衡的求解方法与步骤。     

常数相对风险厌恶多单位拍卖的比较静态与定价结构

考虑竞价者具有常数相对风险厌恶时的多单位拍卖问题,讨论均衡出价与风险偏好以及价值分布之间的关系.在竞价者具有相同的风险偏好的对称拍卖情形,利用风险中性等价导出了比较静态的充要条件,这一充要条件综合了风险偏好和价值分布的变化.在竞价者具有不同的风险偏好的非对称拍卖中,导出了均衡出价关于风险偏好的线性定价结构,依据这一结构,对任意给定出价,竞价者要求的剩余是其风险厌恶参数的线性函数,并且可以分解为竞争性剩余和风险厌恶剩余.     

具有四条裂纹的圆形孔口问题的应力分析

利用复变函数的方法,通过构造保角映射研究了具有四条裂纹(一对非对称共线裂纹和一对对称共线裂纹)的圆形孔口的平面弹性问题,给出了裂纹尖端应力强度因子的解析解.并由此模拟出了具有三条裂纹、对称四条裂纹、非对称共线双裂纹、对称共线双裂纹的圆形孔口,以及非对称十字裂纹,十字裂纹,T形裂纹问题.     

基于统一价格拍卖的初始排污权分配方法

针对初始排污权总量分配的实际问题,基于统一价格拍卖的思想提出了一种具有激励性的可变总量的分配方法,分别给出了排污企业对称和排污企业非对称两种情形下的线性均衡报价策略,并证明了该方法的可行性和有效性,从而为建设排污权分配和交易制度提供了理论依据和方法参考.     

考虑相对业绩的最优投资选择博弈问题研究

研究了具有相互作用的两个竞争机构投资者之间的离散时间最优投资选择博弈问题,每个机构投资者都考虑其竞争对手的相对业绩.机构投资者可以投资于相同的无风险资产和不同的具有相关关系的风险股票,以反映投资的资产专门化.机构投资者选择投资组合策略使得期望终端绝对财富和相对财富的效用最大.首先,定义了Nash均衡投资组合选择策略.然后,在机构投资者具有指数效用函数的假设下,得到了Nash均衡投资组合选择策略和值函数的显示表达式,分析了机构投资者之间的竞争对Nash均衡投资组合选择策略的影响.最后,通过数值计算给出了各种情况下Nash均衡投资组合选择策略和值函数与模型主要参数之间的关系.结果表明:机构投资者之间的竞争会影响其对风险的承担,投资机会集对机构投资者的Nash均衡投资组合选择策略和值函数与模型主要参数之间的关系会产生很大的影响.     

一类非对称各向同性张量函数导数的不变表示

将Dui和Chen于2004年提出的求解对称各向同性张量函数导数的方法推广到一类满足可交换条件的非对称各向同性张量函数情况,此类函数比以往研究的更具一般性.在有3个不同特征根时,由可交换性引进张量函数相对应的标量函数,进而求得此类非对称各向同性张量函数及其导数的不变表示形式.在2或3重特征根时,利用求极限的办法给出此类张量函数及其导数的表示形式.     

不确定偏好序下的双边匹配博弈

针对带有不确定偏好序的双边匹配问题,现有方法大都仅注重整体收益之和,忽略了参与人的个体收益以及在交互选择中的策略运用.基于最大满意度准则,给出不确定序下的收益（满意度）矩阵的推导过程;然后,从个体理性视角,结合矩阵博弈的思想构建一种兼顾整体和个体收益的博弈匹配优化模型,并证明模型最优解满足纳什均衡.最后,进一步探讨各种策略选择及其优劣分析.     

不完全博弈学习过程的虚拟行动规则

本文把博弈学习虚拟行动规则的学习时间一般化,研究不完全学习过程中参与人策略选择的收敛性及效用一致性问题.分析结果表明:当学习时间不完全时,在学习一致到达的条件下,虚拟行动规则对严格纳什均衡是吸收的;在学习时间充分及时与虚拟行动非频繁转换的条件下,各参与人的虚拟行动具有效用一致性.     

Equilibrium and revenue in a family of common-value first-price auctions with differential information

We study a discrete common-value auction environment with two asymmetrically informed bidders. Equilibrium of the first-price auction is in mixed strategies, which we characterize using a doubly recursive solution method. The distribution of bids for the ex post strong player stochastically dominates that for the ex post weak player. This result complements Maskin and Riley’s (Rev Econ Stud 67:413–438, 2000) similar result for asymmetric private-value auctions. Finally, comparison with the dominance-solvable equilibrium in a second-price auction shows the Milgrom–Weber (Econometrica 50:1089–1122, 1982a) finding that the second-price auction yields at least as much revenue as the first-price auction fails with asymmetry: in some cases the first-price auction provides greater expected revenue, in some cases less.     

Multi-unit auctions with complementarities: Issues of efficiency in electricity auctions

In this paper, we analyze the ability of different auction structures to induce the efficient dispatch in a one-shot framework where generators know their own and competitors' costs with certainty. In particular, we are interested in identifying which, if any, rules in an auction structure yield only the efficient dispatch in equilibrium. We find that a critical component to a successful auction design is the way in which demand is bundled and hence the way bids are defined. While an auction mechanism which allows for more than one winner in an auction may support inefficient dispatches in equilibrium, we find that an auction where there is exactly one winner per lot, where the lots are formed to capture the cost structure of generation plants, and all lots are auctioned simultaneously, supports only efficient dispatches in equilibrium.     

Nonsmooth optimization reformulations of player convex generalized Nash equilibrium problems

Using a regularized Nikaido-Isoda function, we present a (nonsmooth) constrained optimization reformulation of the player convex generalized Nash equilibrium problem (GNEP). Further we give an unconstrained reformulation of a large subclass of player convex GNEPs which, in particular, includes the jointly convex GNEPs. Both approaches characterize all solutions of a GNEP as minima of optimization problems. The smoothness properties of these optimization problems are discussed in detail, and it is shown that the corresponding objective functions are continuous and piecewise continuously differentiable under mild assumptions. Some numerical results based on the unconstrained optimization reformulation being applied to player convex GNEPs are also included.     

Optimal bidding in auctions of mixed populations of bidders

A mixed population of bidders consists of two asymmetric groups. Members of the first group are game-theoretic players, who maximize their expected profit and incorrectly believe that their opponents act similarly. The second group of bidders adopts an irrational strategy: they either choose their bids randomly following a given probability distribution, in a “naïve” form of bidding, or follow a decision-theoretic approach, maximizing their expected profit under the assumption that all other bids are random. In a sealed bid private-value procurement auction we examine the optimal strategy of a new player, who has perfect knowledge of the structure of the mixed bidder population and enters the auction. The optimal bid of the new bidder is derived when the cost and mark-up follow a uniform distribution in [0, 1]. The effect of the relative size of the group of game-theoretic bidders and the population size on the optimal bid price is established.     

Fraction auctions: The tradeoff between efficiency and running time

This paper studies the sales of a single indivisible object where bidders have continuous valuations. In Grigorieva et al. [14] it was shown that, in this setting, query auctions necessarily allocate inefficiently in equilibrium. In this paper we propose a new sequential auction, called the c-fraction auction. We show the existence of an ex-post equilibrium, called bluff equilibrium, in which bidders behave truthfully except for particular constellations of observed bids at which it is optimal to pretend a slightly higher valuation. We show c-fraction auctions guarantee approximate efficiency at any desired level of accuracy, independent of the number of bidders, when bidders choose to play the bluff equilibrium. We discuss the running time and the efficiency in the bluff equilibrium. We show that by changing the parameter c of the auction we can trade off efficiency against running time.     

Player splitting in extensive form games

By a player splitting we mean a mechanism that distributes the information sets of a player among so-called agents. A player splitting is called independent if each path in the game tree contains at most one agent of every player. Following Mertens (1989), a solution is said to have the player splitting property if, roughly speaking, the solution of an extensive form game does not change by applying independent player splittings. We show that Nash equilibria, perfect equilibria, Kohlberg-Mertens stable sets and Mertens stable sets have the player splitting property. An example is given to show that the proper equilibrium concept does not satisfy the player splitting property. Next, we give a definition of invariance under (general) player splittings which is an extension of the player splitting property to the situation where we also allow for dependent player splittings. We come to the conclusion that, for any given dependent player splitting, each of the above solutions is not invariant under this player splitting. The results are used to give several characterizations of the class of independent player splittings and the class of single appearance structures by means of invariance of solution concepts under player splittings. Received: December 1996/Revised Version: January 2000     

Loss of skills in coordination games

This paper deals with 2-player coordination games with vanishing actions, which are repeated games where all diagonal payoffs are strictly positive and all non-diagonal payoffs are zero with the following additional property: At any stage beyond r, if a player has not played a certain action for the last r stages, then he unlearns this action and it disappears from his action set. Such a game is called an r-restricted game. To evaluate the stream of payoffs we use the average reward. For r = 1 the game strategically reduces to a one-shot game and for r ≥ 3 in Schoenmakers (Int Game Theory Rev 4:119–126, 2002) it is shown that all payoffs in the convex hull of the diagonal payoffs are equilibrium rewards. In this paper for the case r = 2 we provide a characterization of the set of equilibrium rewards for 2 × 2 games of this type and a technique to find the equilibrium rewards in m × m games. We also discuss subgame perfection.     

Vickrey–Dutch procurement auction for multiple items

We consider a setting where there is a manufacturer who wants to procure multiple items from a set of suppliers each of whom can supply one or more of these items (bundles). We design an ascending price auction for such a setting which implements the Vickrey–Clarke–Groves outcome and truthful bidding is an ex post Nash equilibrium. Our auction maintains non-linear and non-anonymous prices throughout the auction. This auction has a simple price adjustment step and is easy to implement in practice. As offshoots of this auction, we also suggest other simple auctions (in which truthful bidding is not an equilibrium by suppliers) which may be suitable where incentives to suppliers are not a big concern. Computer simulations of our auction show that it is scalable for the multi-unit case, and has better information revelation properties than its descending auction counterpart.