首页 > 最新文献

arXiv - ECON - Theoretical Economics最新文献

英文 中文
Fairness in Multi-Proposer-Multi-Responder Ultimatum Game 多提议者-多回应者最后通牒博弈的公平性
Pub Date : 2024-08-05 DOI: arxiv-2408.02410
Hana Krakovská, Rudolf Hanel, Mark Broom
The Ultimatum Game is conventionally formulated in the context of twoplayers. Nonetheless, real-life scenarios often entail community interactionsamong numerous individuals. To address this, we introduce an extended versionof the Ultimatum Game, called the Multi-Proposer-Multi-Responder UltimatumGame. In this model, multiple responders and proposers simultaneously interactin a one-shot game, introducing competition both within proposers and withinresponders. We derive subgame-perfect Nash equilibria for all scenarios andexplore how these non-trivial values might provide insight into proposal andrejection behavior experimentally observed in the context of one vs. oneUltimatum Game scenarios. Additionally, by considering the asymptotic numbersof players, we propose two potential estimates for a "fair" threshold: either31.8% or 36.8% of the pie (share) for the responder.
按照惯例,最后通牒游戏是在两个玩家的情况下进行的。然而,现实生活中经常会出现众多个体之间的群体互动。为了解决这个问题,我们引入了一个扩展版的最后通牒博弈,称为多提议者-多回应者最后通牒博弈。在这个模型中,多个回应者和提议者同时在一次博弈中互动,从而引入了提议者内部和回应者内部的竞争。我们推导出了所有情景下的亚博弈完全纳什均衡,并探讨了这些非三维值如何为实验中观察到的一比一最后通牒博弈情景下的提议和拒绝行为提供启示。此外,通过考虑玩家的渐近数量,我们提出了两个潜在的 "公平 "阈值估计值:31.8% 或 36.8% 的蛋糕(份额)归响应者所有。
{"title":"Fairness in Multi-Proposer-Multi-Responder Ultimatum Game","authors":"Hana Krakovská, Rudolf Hanel, Mark Broom","doi":"arxiv-2408.02410","DOIUrl":"https://doi.org/arxiv-2408.02410","url":null,"abstract":"The Ultimatum Game is conventionally formulated in the context of two\u0000players. Nonetheless, real-life scenarios often entail community interactions\u0000among numerous individuals. To address this, we introduce an extended version\u0000of the Ultimatum Game, called the Multi-Proposer-Multi-Responder Ultimatum\u0000Game. In this model, multiple responders and proposers simultaneously interact\u0000in a one-shot game, introducing competition both within proposers and within\u0000responders. We derive subgame-perfect Nash equilibria for all scenarios and\u0000explore how these non-trivial values might provide insight into proposal and\u0000rejection behavior experimentally observed in the context of one vs. one\u0000Ultimatum Game scenarios. Additionally, by considering the asymptotic numbers\u0000of players, we propose two potential estimates for a \"fair\" threshold: either\u000031.8% or 36.8% of the pie (share) for the responder.","PeriodicalId":501188,"journal":{"name":"arXiv - ECON - Theoretical Economics","volume":"3 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141968817","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Bargaining via Weber's law 通过韦伯定律讨价还价
Pub Date : 2024-08-05 DOI: arxiv-2408.02492
V. G. Bardakhchyan, A. E. Allahverdyan
We solve the two-player bargaining problem using Weber's law inpsychophysics, which is applied to the perception of utility changes. Byapplying this law, one of the players (or both of them) defines lower and upperutility thresholds, such that once the lower threshold is established,bargaining continues in the inter-threshold domain where the solutions areacceptable to both parties. This provides a sequential solution to thebargaining problem, and it can be implemented iteratively reaching well-definedoutcomes. The solution is Pareto-optimal, symmetric, and is invariant toaffine-transformations of utilities. For susceptible players, iterations areunnecessary, so they converge in one stage toward the (axiomatic) Nash solutionof the bargaining problem. This situation also accounts for the asymmetric Nashsolution, where the weights of each player are expressed via their Weberconstants. Thus the Nash solution is reached without external arbiters andwithout requiring the independence of irrelevant alternatives. Fornon-susceptible players our approach leads to different results.
我们利用心理物理学中的韦伯定律来解决双人讨价还价问题,该定律适用于对效用变化的感知。通过应用该定律,其中一方(或双方)定义了效用的下限和上限,这样一旦下限确定,讨价还价就会在双方都能接受的阈值间领域继续进行。这就为讨价还价问题提供了一个连续的解决方案,它可以通过迭代实现,达到明确定义的结果。该解决方案是帕累托最优的、对称的,并且对效用的咖啡因变换保持不变。对于易受影响的博弈者来说,迭代是不必要的,因此他们会在一个阶段内收敛到讨价还价问题的(公理)纳什解。这种情况也是非对称纳什解的原因,在非对称纳什解中,每个博弈者的权重都是通过他们的韦伯常数来表示的。因此,纳什解的达成不需要外部仲裁者,也不需要无关替代方案的独立性。对于非受影响的博弈者,我们的方法会导致不同的结果。
{"title":"Bargaining via Weber's law","authors":"V. G. Bardakhchyan, A. E. Allahverdyan","doi":"arxiv-2408.02492","DOIUrl":"https://doi.org/arxiv-2408.02492","url":null,"abstract":"We solve the two-player bargaining problem using Weber's law in\u0000psychophysics, which is applied to the perception of utility changes. By\u0000applying this law, one of the players (or both of them) defines lower and upper\u0000utility thresholds, such that once the lower threshold is established,\u0000bargaining continues in the inter-threshold domain where the solutions are\u0000acceptable to both parties. This provides a sequential solution to the\u0000bargaining problem, and it can be implemented iteratively reaching well-defined\u0000outcomes. The solution is Pareto-optimal, symmetric, and is invariant to\u0000affine-transformations of utilities. For susceptible players, iterations are\u0000unnecessary, so they converge in one stage toward the (axiomatic) Nash solution\u0000of the bargaining problem. This situation also accounts for the asymmetric Nash\u0000solution, where the weights of each player are expressed via their Weber\u0000constants. Thus the Nash solution is reached without external arbiters and\u0000without requiring the independence of irrelevant alternatives. For\u0000non-susceptible players our approach leads to different results.","PeriodicalId":501188,"journal":{"name":"arXiv - ECON - Theoretical Economics","volume":"53 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141933573","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Inventory problems and the parametric measure $m_λ$ 库存问题和参数度量 $m_λ$
Pub Date : 2024-08-04 DOI: arxiv-2408.02700
Irina Georgescu
The credibility theory was introduced by B. Liu as a new way to describe thefuzzy uncertainty. The credibility measure is the fundamental notion of thecredibility theory. Recently, L.Yang and K. Iwamura extended the credibilitymeasure by defining the parametric measure $m_{lambda}$ ($lambda$ is a realparameter in the interval $[0,1]$ and for $lambda= 1/2$ we obtain as aparticular case the notion of credibility measure). By using the$m_{lambda}$-measure, we studied in this paper a risk neutral multi-iteminventory problem. Our construction generalizes the credibilistic inventorymodel developed by Y. Li and Y. Liu in 2019. In our model, the components ofdemand vector are fuzzy variables and the maximization problem is formulated byusing the notion of $m_{lambda}$-expected value. We shall prove a generalformula for the solution of optimization problem, from which we obtainedeffective formulas for computing the optimal solutions in the particular caseswhere the demands are trapezoidal and triangular fuzzy numbers. For$lambda=1/2$ we obtain as a particular case the computation formulas of theoptimal solutions of the credibilistic inventory problem of Li and Liu. Thesecomputation formulas are applied for some $m_{lambda}$-models obtained fromnumerical data.
可信度理论由 B. Liu 提出,是描述模糊不确定性的一种新方法。可信度度量是可信度理论的基本概念。最近,L.Yang 和 K. Iwamura 通过定义参数度量 $m_{lambda}$($lambda$ 是区间 $[0,1]$ 中的实参数,对于 $lambda=1/2$,我们得到了可信度量的特殊概念)扩展了可信度量。通过使用 $m_{lambda}$ 度量,我们在本文中研究了一个风险中性的多项目库存问题。我们的构造概括了李一和刘一在 2019 年提出的可信库存模型。在我们的模型中,需求向量的分量是模糊变量,最大化问题通过使用 $m_{lambda}$ 预期值的概念来表述。我们将证明优化问题求解的一般公式,并从中获得计算需求为梯形模糊数和三角形模糊数的特殊情况下最优解的有效公式。对于$lambda=1/2$,我们得到了李和刘的可信库存问题最优解的计算公式。这些计算公式适用于从数字数据中得到的一些 $m_{lambda}$ 模型。
{"title":"Inventory problems and the parametric measure $m_λ$","authors":"Irina Georgescu","doi":"arxiv-2408.02700","DOIUrl":"https://doi.org/arxiv-2408.02700","url":null,"abstract":"The credibility theory was introduced by B. Liu as a new way to describe the\u0000fuzzy uncertainty. The credibility measure is the fundamental notion of the\u0000credibility theory. Recently, L.Yang and K. Iwamura extended the credibility\u0000measure by defining the parametric measure $m_{lambda}$ ($lambda$ is a real\u0000parameter in the interval $[0,1]$ and for $lambda= 1/2$ we obtain as a\u0000particular case the notion of credibility measure). By using the\u0000$m_{lambda}$-measure, we studied in this paper a risk neutral multi-item\u0000inventory problem. Our construction generalizes the credibilistic inventory\u0000model developed by Y. Li and Y. Liu in 2019. In our model, the components of\u0000demand vector are fuzzy variables and the maximization problem is formulated by\u0000using the notion of $m_{lambda}$-expected value. We shall prove a general\u0000formula for the solution of optimization problem, from which we obtained\u0000effective formulas for computing the optimal solutions in the particular cases\u0000where the demands are trapezoidal and triangular fuzzy numbers. For\u0000$lambda=1/2$ we obtain as a particular case the computation formulas of the\u0000optimal solutions of the credibilistic inventory problem of Li and Liu. These\u0000computation formulas are applied for some $m_{lambda}$-models obtained from\u0000numerical data.","PeriodicalId":501188,"journal":{"name":"arXiv - ECON - Theoretical Economics","volume":"4 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141968815","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The Logic of Political Survival Revisited: Consequences of Elite Uncertainty Under Authoritarian Rule 再论政治生存的逻辑:专制统治下精英不确定性的后果
Pub Date : 2024-08-04 DOI: arxiv-2408.01887
Tamar Zeilberger
Existing research has established that autocrats offer concessions to preventouster by their inner circle. This paper examines how those concessions areinfluenced by the relative uncertainty of an autocrat's inner circle aboutremaining in that favored body. I take as my starting point the formal model ofpolitical survival presented in Bueno de Mesquita et al.'s The Logic ofPolitical Survival. I extend the model to account for variation in the relativeuncertainty of an autocrat's inner circle. To make the math tractable, Idispense with convention and introduce comparative statics across two modelswith different formulations of uncertainty. This exercise reveals a set ofconditions under which to expect an increase in the concessions offered by anautocrat, with implications for development and democracy. Those findings yielda corresponding set of logical corollaries with potential to further ourunderstanding of authoritarian politics, including an unexamined facet of the"dictator's dilemma" (Wintrobe 1990, 1998) and related incentives for membersof an inner circle to permit purges or act to destabilize their ranks. Themodels also identify a source of policy volatility not found outside ofautocracies. Taken together, the findings suggest a need for more research onelite uncertainty in autocracies.
现有研究已经证实,专制者会做出让步,以防止其核心圈子对其施压。本文探讨了这些让步如何受到专制者核心圈子对继续留在该受宠机构的相对不确定性的影响。我以布埃诺-德-梅斯基塔等人(Bueno de Mesquita et al.我对模型进行了扩展,以考虑专制者核心圈子相对不确定性的变化。为了使数学计算变得简单易行,我不拘泥于常规,而是引入了两个对不确定性有不同表述的模型的比较统计。这项工作揭示了一系列条件,在这些条件下,可以预期专制者会增加让步,从而对发展和民主产生影响。这些发现产生了一系列相应的逻辑推论,有可能进一步加深我们对独裁政治的理解,其中包括 "独裁者困境"(Wintrobe,1990 年,1998 年)中未被研究的一个方面,以及内部成员允许清洗或采取行动动摇其队伍的相关动机。这些模型还发现了一个在专制政体之外所没有的政策波动来源。综上所述,研究结果表明,有必要对专制政体中的精英不确定性进行更多研究。
{"title":"The Logic of Political Survival Revisited: Consequences of Elite Uncertainty Under Authoritarian Rule","authors":"Tamar Zeilberger","doi":"arxiv-2408.01887","DOIUrl":"https://doi.org/arxiv-2408.01887","url":null,"abstract":"Existing research has established that autocrats offer concessions to prevent\u0000ouster by their inner circle. This paper examines how those concessions are\u0000influenced by the relative uncertainty of an autocrat's inner circle about\u0000remaining in that favored body. I take as my starting point the formal model of\u0000political survival presented in Bueno de Mesquita et al.'s The Logic of\u0000Political Survival. I extend the model to account for variation in the relative\u0000uncertainty of an autocrat's inner circle. To make the math tractable, I\u0000dispense with convention and introduce comparative statics across two models\u0000with different formulations of uncertainty. This exercise reveals a set of\u0000conditions under which to expect an increase in the concessions offered by an\u0000autocrat, with implications for development and democracy. Those findings yield\u0000a corresponding set of logical corollaries with potential to further our\u0000understanding of authoritarian politics, including an unexamined facet of the\u0000\"dictator's dilemma\" (Wintrobe 1990, 1998) and related incentives for members\u0000of an inner circle to permit purges or act to destabilize their ranks. The\u0000models also identify a source of policy volatility not found outside of\u0000autocracies. Taken together, the findings suggest a need for more research on\u0000elite uncertainty in autocracies.","PeriodicalId":501188,"journal":{"name":"arXiv - ECON - Theoretical Economics","volume":"77 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141933581","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Strategic Analysis of Fair Rank-Minimizing Mechanisms with Agent Refusal Option 带有代理拒绝选项的公平排名最小化机制的策略分析
Pub Date : 2024-08-03 DOI: arxiv-2408.01673
Yasunori Okumura
This study examines strategic issues in fair rank-minimizing mechanisms,which choose an assignment that minimizes the average rank of object types towhich agents are assigned and satisfy a fairness property called equaltreatment of equals. As one of these fair mechanisms, the uniformrank-minimizing mechanism is considered. We particularly focus on the casewhere agents can refuse their assignment and obtain the outside option instead.Without the refusal option, if the uniform rank-minimizing mechanism is used,truth-telling is not strategically dominated by any strategies. However, ifagents have the option, then an outside option demotion strategy -- revealingall object types as acceptable without changing the ranking of truly acceptableones -- strategically dominates truth-telling. Moreover, we show that adoptingthis strategy may lead to inefficient assignments. To counter this, we proposethe modified uniform rank-minimizing mechanism, though it may lead agents tostrategically reduce the number of acceptable types.
本研究探讨了公平的等级最小化机制中的策略问题,这种机制选择的分配方式能使代理人被分配的对象类型的平均等级最小化,并满足平等对待的公平属性。作为这些公平机制中的一种,我们考虑了统一等级最小化机制。在没有拒绝选项的情况下,如果使用均匀等级最小化机制,讲真话在战略上不会被任何策略所支配。然而,如果参与者有选择权,那么外部选项降级策略--在不改变真正可接受类型的排序的情况下,揭示所有对象类型都是可接受的--就会在策略上主导讲真话。此外,我们还证明,采用这种策略可能会导致分配效率低下。为了解决这个问题,我们提出了修改后的统一等级最小化机制,尽管它可能会导致代理人策略性地减少可接受类型的数量。
{"title":"Strategic Analysis of Fair Rank-Minimizing Mechanisms with Agent Refusal Option","authors":"Yasunori Okumura","doi":"arxiv-2408.01673","DOIUrl":"https://doi.org/arxiv-2408.01673","url":null,"abstract":"This study examines strategic issues in fair rank-minimizing mechanisms,\u0000which choose an assignment that minimizes the average rank of object types to\u0000which agents are assigned and satisfy a fairness property called equal\u0000treatment of equals. As one of these fair mechanisms, the uniform\u0000rank-minimizing mechanism is considered. We particularly focus on the case\u0000where agents can refuse their assignment and obtain the outside option instead.\u0000Without the refusal option, if the uniform rank-minimizing mechanism is used,\u0000truth-telling is not strategically dominated by any strategies. However, if\u0000agents have the option, then an outside option demotion strategy -- revealing\u0000all object types as acceptable without changing the ranking of truly acceptable\u0000ones -- strategically dominates truth-telling. Moreover, we show that adopting\u0000this strategy may lead to inefficient assignments. To counter this, we propose\u0000the modified uniform rank-minimizing mechanism, though it may lead agents to\u0000strategically reduce the number of acceptable types.","PeriodicalId":501188,"journal":{"name":"arXiv - ECON - Theoretical Economics","volume":"30 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141933571","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Persuading an inattentive and privately informed receiver 说服注意力不集中、私下知情的接收者
Pub Date : 2024-08-02 DOI: arxiv-2408.01250
Pietro Dall'Ara
I study the persuasion of a receiver who accesses information only if sheexerts costly attention effort. The sender designs an experiment to persuadethe receiver to take a specific action. The experiment also affects thereceiver's attention effort, that is, the probability that she updates herbeliefs. As a result, persuasion has two margins: extensive (effort) andintensive (action). The receiver's utility exhibits a supermodularity propertyin information and effort. By leveraging this property, I prove a generalequivalence between experiments and persuasion mechanisms `a la Kolotilin etal. (2017). Censoring high states is an optimal strategy for the sender inapplications.
我研究的是接收者的说服问题,接收者只有付出昂贵的注意力努力才能获取信息。发送者设计了一个实验来说服接收者采取特定行动。实验也会影响接受者的注意努力,即她更新信念的概率。因此,说服有两个边际:广泛(努力)和密集(行动)。接受者的效用在信息和努力方面表现出超模块化特性。通过利用这一特性,我证明了实验与说服机制之间的一般等价性(a la Kolotilin etal.(2017).审查高状态是发送者在应用中的最优策略。
{"title":"Persuading an inattentive and privately informed receiver","authors":"Pietro Dall'Ara","doi":"arxiv-2408.01250","DOIUrl":"https://doi.org/arxiv-2408.01250","url":null,"abstract":"I study the persuasion of a receiver who accesses information only if she\u0000exerts costly attention effort. The sender designs an experiment to persuade\u0000the receiver to take a specific action. The experiment also affects the\u0000receiver's attention effort, that is, the probability that she updates her\u0000beliefs. As a result, persuasion has two margins: extensive (effort) and\u0000intensive (action). The receiver's utility exhibits a supermodularity property\u0000in information and effort. By leveraging this property, I prove a general\u0000equivalence between experiments and persuasion mechanisms `a la Kolotilin et\u0000al. (2017). Censoring high states is an optimal strategy for the sender in\u0000applications.","PeriodicalId":501188,"journal":{"name":"arXiv - ECON - Theoretical Economics","volume":"189 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141933514","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Harmful choices 有害的选择
Pub Date : 2024-08-02 DOI: arxiv-2408.01317
Angelo Petralia
We investigate the choice behavior of a decision maker (DM) who harmsherself, by maximizing some distortion of her true preference, in which thefirst $i$ alternatives are moved to the bottom, in a reversed order. Thedeterministic declination of our pattern has no empirical power, but it allowsto define a degree of self-punishment, which measures the extent of the denialof pleasure adopted by the DM in her decision. We analyze irrational choicesthat display the lowest degree of self-punishment, and a characterization ofthem is provided. Moreover, we characterize the choice behavior that exhibitsthe highest degree of self-punishment, and we show that it comprises almost allchoices. We also characterize stochastic self-punishment, which collects allthe Random Utility Models (RUMs) whose support is restricted to the harmfuldistortions of some preference. Full identification of the DM's preference andrandomization over its harmful distortions is allowed if each alternative isselected from the ground set with probability greater than zero. Finally, thedegree of self-punishment of harmful stochastic choices is characterized.
我们研究了一个决策者(DM)的选择行为,这个决策者通过最大化其真实偏好的某种扭曲来伤害自己,在这种扭曲中,前 $i$ 个备选方案以相反的顺序被移到了底部。我们这种模式的决定性拒绝没有经验可循,但它允许我们定义自我惩罚的程度,以衡量 DM 在决策中对快乐的否定程度。我们分析了自我惩罚程度最低的非理性选择,并对它们进行了描述。此外,我们还描述了自我惩罚程度最高的选择行为,并证明它几乎包含了所有的选择。我们还描述了随机自我惩罚的特征,它收集了所有随机效用模型(RUM),这些模型的支持被限制在某些偏好的有害偏好上。如果每个备选方案从地面集中选出的概率大于零,那么就可以完全识别 DM 的偏好,并对其有害扭曲进行随机化。最后,对有害随机选择的自我惩罚程度进行了描述。
{"title":"Harmful choices","authors":"Angelo Petralia","doi":"arxiv-2408.01317","DOIUrl":"https://doi.org/arxiv-2408.01317","url":null,"abstract":"We investigate the choice behavior of a decision maker (DM) who harms\u0000herself, by maximizing some distortion of her true preference, in which the\u0000first $i$ alternatives are moved to the bottom, in a reversed order. The\u0000deterministic declination of our pattern has no empirical power, but it allows\u0000to define a degree of self-punishment, which measures the extent of the denial\u0000of pleasure adopted by the DM in her decision. We analyze irrational choices\u0000that display the lowest degree of self-punishment, and a characterization of\u0000them is provided. Moreover, we characterize the choice behavior that exhibits\u0000the highest degree of self-punishment, and we show that it comprises almost all\u0000choices. We also characterize stochastic self-punishment, which collects all\u0000the Random Utility Models (RUMs) whose support is restricted to the harmful\u0000distortions of some preference. Full identification of the DM's preference and\u0000randomization over its harmful distortions is allowed if each alternative is\u0000selected from the ground set with probability greater than zero. Finally, the\u0000degree of self-punishment of harmful stochastic choices is characterized.","PeriodicalId":501188,"journal":{"name":"arXiv - ECON - Theoretical Economics","volume":"188 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141933572","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
What does a dynamic oligopoly maximize? The continuous time Markov case 动态寡头垄断的最大化是什么?连续时间马尔科夫案例
Pub Date : 2024-07-30 DOI: arxiv-2407.20810
Juan Pablo Rincón-Zapatero
We analyze the question of whether the outcome of an oligopoly exploiting anonrenewable resource can be replicated by a related monopoly, within theframework of continuous time and Markov Perfect Nash Equilibrium. We establishnecessary and sufficient conditions and find explicit solutions in some cases.Also, very simple models with externalities are shown which Nash equilibriumcannot be replicated in a monopoly.
我们在连续时间和马尔可夫完美纳什均衡的框架内,分析了开采不可再生资源的寡头垄断的结果是否能被相关垄断复制的问题。我们建立了必要条件和充分条件,并在某些情况下找到了明确的解决方案。此外,我们还展示了具有外部性的非常简单的模型,这些模型的纳什均衡无法在垄断中复制。
{"title":"What does a dynamic oligopoly maximize? The continuous time Markov case","authors":"Juan Pablo Rincón-Zapatero","doi":"arxiv-2407.20810","DOIUrl":"https://doi.org/arxiv-2407.20810","url":null,"abstract":"We analyze the question of whether the outcome of an oligopoly exploiting a\u0000nonrenewable resource can be replicated by a related monopoly, within the\u0000framework of continuous time and Markov Perfect Nash Equilibrium. We establish\u0000necessary and sufficient conditions and find explicit solutions in some cases.\u0000Also, very simple models with externalities are shown which Nash equilibrium\u0000cannot be replicated in a monopoly.","PeriodicalId":501188,"journal":{"name":"arXiv - ECON - Theoretical Economics","volume":"75 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141862654","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Impact of Geographical Separation on Spectrum Sharing Markets 地理分隔对频谱共享市场的影响
Pub Date : 2024-07-30 DOI: arxiv-2407.20909
Kangle Mu, Zongyun Xie, Igor Kadota, Randall Berry
With the increasing demand for wireless services, spectrum managementagencies and service providers (SPs) are seeking more flexible mechanisms forspectrum sharing to accommodate this growth. Such mechanisms impact the marketdynamics of competitive SPs. Prior market models of spectrum sharing largelyfocus on scenarios where competing SPs had identical coverage areas. We departfrom this and consider a scenario in which two competing SPs have overlappingbut distinct coverage areas. We study the resulting competition using a Cournotmodel. Our findings reveal that with limited shared bandwidth, SPs might avoidoverlapping areas to prevent potential losses due to interference. SometimesSPs can strategically cooperate by agreeing not to provide service in theoverlapping areas and, surprisingly, customers might also benefit from suchcooperation under certain circumstances. Overall, market outcomes exhibitcomplex behaviors that are influenced by the sizes of coverage areas and thebandwidth of the shared spectrum.
随着无线服务需求的不断增长,频谱管理机构和服务提供商(SP)正在寻求更加灵活的频谱共享机制,以适应这种增长。这种机制影响着竞争性 SP 的市场动态。之前的频谱共享市场模型主要关注的是竞争性 SP 拥有相同覆盖区域的情况。我们与此不同,考虑了两个相互竞争的 SP 拥有重叠但不同的覆盖区域的情况。我们使用库诺模型研究了由此产生的竞争。我们的研究结果表明,在共享带宽有限的情况下,SP 可能会避免重叠区域,以防止由于干扰造成的潜在损失。有时,SP 可以通过同意不在重叠区域提供服务来进行战略合作,令人惊讶的是,在某些情况下,客户也可能从这种合作中受益。总体而言,市场结果表现出受覆盖区域大小和共享频谱带宽影响的复杂行为。
{"title":"Impact of Geographical Separation on Spectrum Sharing Markets","authors":"Kangle Mu, Zongyun Xie, Igor Kadota, Randall Berry","doi":"arxiv-2407.20909","DOIUrl":"https://doi.org/arxiv-2407.20909","url":null,"abstract":"With the increasing demand for wireless services, spectrum management\u0000agencies and service providers (SPs) are seeking more flexible mechanisms for\u0000spectrum sharing to accommodate this growth. Such mechanisms impact the market\u0000dynamics of competitive SPs. Prior market models of spectrum sharing largely\u0000focus on scenarios where competing SPs had identical coverage areas. We depart\u0000from this and consider a scenario in which two competing SPs have overlapping\u0000but distinct coverage areas. We study the resulting competition using a Cournot\u0000model. Our findings reveal that with limited shared bandwidth, SPs might avoid\u0000overlapping areas to prevent potential losses due to interference. Sometimes\u0000SPs can strategically cooperate by agreeing not to provide service in the\u0000overlapping areas and, surprisingly, customers might also benefit from such\u0000cooperation under certain circumstances. Overall, market outcomes exhibit\u0000complex behaviors that are influenced by the sizes of coverage areas and the\u0000bandwidth of the shared spectrum.","PeriodicalId":501188,"journal":{"name":"arXiv - ECON - Theoretical Economics","volume":"44 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141862655","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Lattice operations for the stable set in substitutable matching markets via re-equilibration dynamics 通过再校准动力学实现可替代匹配市场稳定集的网格操作
Pub Date : 2024-07-30 DOI: arxiv-2407.21198
Agustin G. Bonifacio, Noelia Juarez, Paola B. Manasero
We compute the lattice operations for the (pairwise) stable set in two-sidedmatching markets where only substitutability on agents' choice functions isimposed. To do this, we use Tarski operators defined on the lattices ofworker-quasi-stable and firm-quasi-stable matchings. These operators resemblelay-off and vacancy chain dynamics, respectively. First, we compute the latticeoperations in the many-to-one model. Then, we extend these operations to amany-to-many model with substitutable choice functions on one side andresponsive preferences on the other, via a morphism that relates many-to-onewith many-to-many matchings in a natural way. Finally, we present the latticeoperations in the many-to-many model with substitutable choice functions onboth sides.
我们计算双面匹配市场中(成对)稳定集的网格运算,在这种市场中,代理人的选择函数只有可替代性。为此,我们使用了定义在工人-准稳定匹配和企业-准稳定匹配网格上的塔尔斯基算子。这些算子分别类似于解雇和空缺链动力学。首先,我们计算多对一模型中的网格运算。然后,我们将这些运算扩展到多对多模型,该模型的一方是可替代的选择函数,另一方是反应性偏好,我们通过变形将多对一与多对多匹配以自然的方式联系起来。最后,我们介绍了多对多模型中的网格运算,其两边都有可替代的选择函数。
{"title":"Lattice operations for the stable set in substitutable matching markets via re-equilibration dynamics","authors":"Agustin G. Bonifacio, Noelia Juarez, Paola B. Manasero","doi":"arxiv-2407.21198","DOIUrl":"https://doi.org/arxiv-2407.21198","url":null,"abstract":"We compute the lattice operations for the (pairwise) stable set in two-sided\u0000matching markets where only substitutability on agents' choice functions is\u0000imposed. To do this, we use Tarski operators defined on the lattices of\u0000worker-quasi-stable and firm-quasi-stable matchings. These operators resemble\u0000lay-off and vacancy chain dynamics, respectively. First, we compute the lattice\u0000operations in the many-to-one model. Then, we extend these operations to a\u0000many-to-many model with substitutable choice functions on one side and\u0000responsive preferences on the other, via a morphism that relates many-to-one\u0000with many-to-many matchings in a natural way. Finally, we present the lattice\u0000operations in the many-to-many model with substitutable choice functions on\u0000both sides.","PeriodicalId":501188,"journal":{"name":"arXiv - ECON - Theoretical Economics","volume":"10 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141862653","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
arXiv - ECON - Theoretical Economics
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1