Incentive Compatible Cost Sharing of a Coalition Initiative with Probabilistic Inspection and Penalties for Misrepresentation
Autor: | Brian J. Lunday, William N. Caballero, Darryl K. Ahner |
---|---|
Rok vydání: | 2020 |
Předmět: |
Computer Science::Computer Science and Game Theory
Mathematical optimization Mechanism design Computer science Strategy and Management Probabilistic logic Pareto principle TheoryofComputation_GENERAL General Social Sciences General Decision Sciences 02 engineering and technology Multi-objective optimization Bayesian game symbols.namesake Arts and Humanities (miscellaneous) Nash equilibrium Incentive compatibility 020204 information systems Management of Technology and Innovation 0202 electrical engineering electronic engineering information engineering symbols Cost sharing 020201 artificial intelligence & image processing |
Zdroj: | Group Decision and Negotiation. 29:1021-1055 |
ISSN: | 1572-9907 0926-2644 |
DOI: | 10.1007/s10726-020-09693-z |
Popis: | This research proposes cost sharing mechanisms such that payments for a coalition initiative are allocated among players based on their honest valuations of the initiative, probabilistic inspection efforts, and deception penalties. Specifically, we develop a set of multiobjective, nonlinear optimization problem formulations that alternatively impose Bayesian incentive compatible, strategyproof, or group strategyproof mechanisms with generalized cost sharing and penalty functions that can be tailored to specific applications. Any feasible solution to these problems corresponds to a Bayesian game with stochastic payoffs wherein a collectively honest declaration is a Bayes–Nash equilibrium, a Nash equilibrium in dominant strategies, or a collusion resistant Nash equilibrium, respectively, and wherein an optimal solution considers the central authority’s relative priorities between inspection and penalization. In addition to this general framework, we introduce special cases having specific cost sharing and penalty functions such that the set of mechanisms are budget-balanced-in-equilibrium and proportional by design. The convexity of the resulting mathematical programs are examined, and formulation size reductions due to constraint redundancy analyses are presented. The Pareto fronts associated with each multiobjective optimization problem are assessed, as are computer memory limitations. Finally, an experiment considers the clustering of available valuations and the player probability distributions over them to examine their effects. |
Databáze: | OpenAIRE |
Externí odkaz: | |
Nepřihlášeným uživatelům se plný text nezobrazuje | K zobrazení výsledku je třeba se přihlásit. |