企业责任：让利益相关者满意

随着社会的发展和企业能力的增强,企业需要承担越来越多的责任,让越来越多的利益相关者满意。中国企业需要对自己的战略进行调整,以应对这种新趋势。     

Assignment maximization

We evaluate the goal of maximizing the number of individuals matched to acceptable outcomes. We present two mechanisms that maximize assignments. The first is Pareto efficient and undominated—in terms of the number of assignments—in equilibrium. The second is fair for unassigned agents and assigns weakly more agents than any stable mechanism in equilibrium.     

Common Pool Games are Convex Games

For the class of cooperative common pool games the paper focuses on the question of how, during the preplay negotiation process, the ability of coalitions to enforce their claims imposes externalities on the opposition by having an impact on the jointly produced resource. One of our main results is that common pool games are clear games. Based on this result we are able to derive sufficient conditions for the convexity of the characteristic function, which establishes the second main result in the paper, namely that cooperative common pool games are characterized by increasing returns with respect to the coalition size.     

Ambiguous Games

This paper introduces ambiguous games, a modification of the normal form that allows the presence of vagueness in players' beliefs over the opponents' choice of strategies. An appropriate notion of equilibrium is presented, and a general existence result is proved. Journal of Economic Literature Classification Numbers: C72, D81.     

Knowledge Games

The subject of epistemic logic is firmly entrenched in game theory, including the analysis of common knowledge and of public announcements, such as in 'hat problems'. How to analyse communications to sub groups of the public, and the effects of such common knowledge of a subgroup on the information state of a larger group, has only recently come into fruition. Knowledge games are introduced to provide a comfortably concrete vehicle for the study of such interactions. This paper introduces the concepts of knowledge game, deal of cards, knowledge game state, game action, and action execution. A deal of cards is a function from cards to players. A knowledge game state is represented by a pointed multiagent S5 model on the set of card deals where all players hold the same number of cards as in the actual deal. A game action combines a question with an answer, and is represented by a pointed multiagent S5 frame on the set of possible answers. The execution of a game action in a knowledge game state corresponds to the computation of a pointed multiagent S5 model that is a restriction of the direct product of the corresponding action frame and game model.     

Action-Graph Games

Representing and reasoning with games becomes difficult once they involve large numbers of actions and players, because the space requirement for utility functions can grow unmanageably. Action-Graph Games (AGGs) are a fully-expressive game representation that can compactly express utility functions with structure such as context-specific independence, anonymity, and additivity. We show that AGGs can be used to compactly represent all games that are compact when represented as graphical games, symmetric games, anonymous games, congestion games, and polymatrix games, as well as games that require exponential space under all of these existing representations. We give a polynomial-time algorithm for computing a player's expected utility under an arbitrary mixed-strategy profile, and show how to use this algorithm to achieve exponential speedups of existing methods for computing sample Nash equilibria. We present results of experiments showing that using AGGs leads to a dramatic increase in the size of games accessible to computational analysis.²     

The Package Assignment Model

We study assignment problems where individuals trade packages consisting of several, rather than single, objects. Although buyers' reservations values are non-additive, efficient assignments can be formulated as a linear programming problem in which the pricing functions expressing duality may be non-linear in the objects constituting the packages. The interconnections among the linear programming formulation, Walrasian equilibrium, and the core are established. In the single seller (auction) version, a necessary and sufficient condition is given for the Vickrey payoff point to be implementable by a pricing equilibrium. Journal of Economic Literature Classification Numbers: C62, D44, D51.     

The Scholarship Assignment Problem

There are n graduate students and n faculty members. Each student will be assigned a scholarship by the joint faculty. The socially optimal outcome is that the best student should get the most prestigious scholarship, the second-best student should get the second most prestigious scholarship, and so on. The socially optimal outcome is common knowledge among all faculty members. Each professor wants one particular student to get the most prestigious scholarship and wants the remaining scholarships to be assigned according to the socially optimal outcome. We consider the problem of finding a mechanism such that in equilibrium, all scholarships are assigned according to the socially optimal outcome. Journal of Economic Literature Classification Numbers: D70, D78.     

Assignment models and reneging

Summary. We consider a non-cooperative assignment model where we show that any subgame perfect equilibrium is stable, and that an appropriate refinement criterion leads to the p-optimal outcome. We then consider a model with reneging and derive some interesting properties of this game. We show that in this case ‘unraveling’ may occur. Furthermore, the resulting outcome can be either stable, or unstable. Received: July 1, 1997; revised version: May 30, 1998     

Network Games

In contexts ranging from public goods provision to information collection, a player's well-being depends on his or her own action as well as on the actions taken by his or her neighbours. We provide a framework to analyse such strategic interactions when neighbourhood structure, modelled in terms of an underlying network of connections, affects payoffs. In our framework, individuals are partially informed about the structure of the social network. The introduction of incomplete information allows us to provide general results characterizing how the network structure, an individual's position within the network, the nature of games (strategic substitutes vs. complements and positive vs. negative externalities) and the level of information shape individual behaviour and payoffs.     

A New Solution to the Random Assignment Problem

A random assignment is ordinally efficient if it is not stochastically dominated with respect to individual preferences over sure objects. Ordinal efficiency implies (is implied by) ex post (ex ante) efficiency. A simple algorithm characterizes ordinally efficient assignments: our solution, probabilistic serial (PS), is a central element within their set. Random priority (RP) orders agents from the uniform distribution, then lets them choose successively their best remaining object. RP is ex post, but not always ordinally, efficient. PS is envy-free, RP is not; RP is strategy-proof, PS is not. Ordinal efficiency, Strategyproofness, and equal treatment of equals are incompatible. Journal of Economic Literature Classification Numbers: C78, D61, D63.     

Resale Markets and the Assignment of Property Rights

The consumption of an indivisible good causes identity-dependent externalities to non-consumers. We analyse resale markets where the current owner designs the trading procedure, but cannot commit to future actions. We ask the following questions: (1) Does the identity of the initial owner matter for the determination of the final consumer? (2) Is the outcome always efficient? The major conclusion of our paper is that the irrelevance of the initial structure of property rights arises in resale processes even if there are transaction costs that hinder efficiency. This result complements the Coasian view where the irrelevance of the assignment of property rights is a consequence of efficiency.     

Bartering Games in the Kolm Triangle

We study a public good mechanism that possesses several attractive properties. In particular, the mechanism always produces feasible allocations, induces a game where the Nash equilibria are all individually rational, and, in contrast to the voluntary contribution mechanism, supports the Lindahl allocation as a Nash equilibrium allocation. The geometric framework of the Kolm triangle is employed to illustrate the workings of the mechanism and provide intuition for the main results.     

博弈论的新发展:行为博弈论

标准博弈论在经济理性假设下分析博弈参与者如何在追求各自最优目标的同时实现均衡。但是,由于现实行为人是有限理性的,标准博弈论对实践的解释和指导受到限制。为了延伸博弈论对现实活动的解释,行为博弈论将实验经济学与标准博弈论相融合,在博弈实验的基础上,考察和解释标准理论推断与实验结果之间的差异,引入行为因素改进标准博弈论的基本假定,重构博弈分析模型,以求达到准确解读有限理性的行为人在现实约束中如何行动的目的。     

Simple Flow Games

This paper considers simple flow situations. We introduce the minimum cut solution and characterize it in terms of one-person efficiency, consistency, and converse consistency. Furthermore, we give several relations between the core of a simple flow game and four other solution concepts: the minimum cut solution, the least core, the kernel, and the bargaining set.Journal of Economic LiteratureClassification Numbers: C71.     

Extendable Cooperative Games

A (TU) cooperative game is extendable if every core allocation of each subgame can be extended to a core allocation of the game. It is strongly extendable if any minimal vector in the upper core of any of its subgames can be extended to a core allocation. We prove that strong extendability is equivalent to largeness of the core. Further, we characterize extendability in terms of an extension of the balanced cover of the game. It is also shown how this extension can unify the analysis of many families of games under one roof.     

Absorbing Team Games

A team is a group of people having the same motives but possibly different available actions. A team game is a game where two teams face each other. An absorbing game is a repeated game where some of the entries are absorbing, in the sense that once they are chosen the play terminates, and all future payoffs are equal to the payoff at the stage of termination. We prove that every absorbing team game has an equilibrium payoff and that there are -equilibrium profiles with cyclic structure. Journal of Economic Literature Classification Numbers: C72, C73.     

会计委派制之我见

本文拟从会计人员自身的因素及其所处的工作环境、社会环境，分析我国目前会计信息失真、会计监督弱化问题，进一步探讨会计委派制的可行性及问题所在，并提出自己的设想和建议。