Summary and Info
Abstract: A (or a group of) selling agent wants to allocate andsell a (or a set of) parcel of land optimally and fairly to a buyingagent within the capacity constraint of the selling agent andbudget constraint of the buying agent. This problem has beensolved by combining the concept of algorithmic cooperative gametheory and financial cryptography. This is an approach for agroup of decision-making agents to reach a mutually beneficialagreement through compromise and stable matching ofpreference. The paper presents a cooperative game and a set ofalgorithmic coordination mechanisms: SBSS, SBMS (forcollective and non-collective bargaining in holdout problem) andMBSS. The game is characterized by a set of agents, inputs,strategic moves, revelation principle, payment function andoutputs. The coordination mechanisms are designed based ondomain planning, rational fair data exchange and compensationnegotiation. These mechanisms preserve the privacy of strategicdata through secure multi-party computation (SMC). Themechanisms are analyzed from the perspectives of revelationprinciple, computational intelligence and communicationcomplexity. The communication complexity depends on the timeconstraint of the negotiating agents, their information state andthe number of negotiation issues. The computational complexitydepends on the valuation of pricing plan, compensationestimation and private comparison. It is a mixed strategy game;both sequential and simultaneous moves can be appliedintelligently to search a neighborhood space of core solutions.Categories and Subject Descriptors Cooperative gameGeneral Terms Algorithmic mechanismKeywords: Cooperative game, Coordination mechanisms,Computational intelligence, Valuation, Hedonic pricing,Compensation, Financial cryptography.
Review and Comments
Rate the Book
Land Allocation : Intelligent Coordination Mechanisms for a Hedonic Game 0 out of 5 stars based on 0 ratings.