Results 41 to 50 of about 80,797 (168)
CAAI Transactions on Intelligence Technology, EarlyView.ABSTRACT The evaluation and assessment of network security is a decision‐making (DM) problem that occurs in an environment with multiple criteria, which have uncertainty, bipolarity, and extra‐related information. The traditional approaches fail to address the need to acquire a wide range of information for the assessment, especially in situations ...
Walid Emam +3 more
wiley +1 more source
Beck's Conjecture for Power Graphs [PDF]
, 2014 Beck's conjecture on coloring of graphs associated to various algebraic objects has generated considerable interest in the community of discrete mathematics and combinatorics since its inception in the year 1988.
Das, Priya, Mukherjee, Himadri
core
Competitive diplomacy in bargaining and war
American Journal of Political Science, EarlyView.Abstract War is often viewed as a bargaining problem. However, prior to bargaining, countries can vie for leverage by expending effort on diplomacy. This article presents a dynamic model of conflict where agenda‐setting power is endogenous to pre‐bargaining diplomatic competition.
Joseph J. Ruggiero
wiley +1 more source
How Can Inflation Contracts Discipline Central Bankers When Agents Are Learning?
Bulletin of Economic Research, EarlyView.ABSTRACT This paper studies, in a new Keynesian model with a positive optimal output gap, how to design linear inflation contracts to shape the central bank's incentive structure when private expectations are based on adaptive learning. In this model, under rational expectations, inflation contracts could only partially deal with the time‐inconsistency
Marine Charlotte André, Meixing Dai
wiley +1 more source
3-Colourability of Dually Chordal Graphs in Linear Time [PDF]
, 2012 A graph G is dually chordal if there is a spanning tree T of G such that any maximal clique of G induces a subtree in T. This paper investigates the Colourability problem on dually chordal graphs.
Leitert, Arne
core
Late payments, higher prices? An experimental investigation of competitive procurement
Decision Sciences, EarlyView.Abstract The decision to pay one's supplier late is commonplace across global supply chains and, arguably, a key challenge for many businesses. In a multiple‐methods study, we contribute to the literature by documenting important empirical and anecdotal features about the likelihood and severity of late payments, formulating and solving a theoretical ...
Matthew J. Walker, Kyle Hyndman
wiley +1 more source
Strategic Flip‐Flopping in Political Competition
International Economic Review, EarlyView.ABSTRACT We study candidates' position adjustments in response to information about voters' preferences. Repositioning allows candidates to move closer to the median voter, but it incurs financial and electoral costs. In a subgame‐perfect equilibrium, candidates diverge from the center ex ante if the costs of adjustment are sufficiently large.
Gaëtan Fournier +2 more
wiley +1 more source
Limit Orders and Knightian Uncertainty
International Economic Review, EarlyView.ABSTRACT A wide variety of financial instruments allows risk‐averse traders to reduce their exposure to risk. This raises the question of what financial instruments allow ambiguity‐averse traders to reduce their exposure to ambiguity. We show in this paper that price‐contingent orders, such as limit orders, are sufficient: In a two‐period trading model,
Michael Greinecker, Christoph Kuzmics
wiley +1 more source
Evaluating Allocations of Opportunities
International Economic Review, EarlyView.ABSTRACT This paper provides a robust criterion for comparing lists of probability distributions—interpreted as allocations of opportunities—faced by different social groups. We axiomatically argue in favor of comparing those lists of probability distributions on the basis of a uniform—among groups—valuation of their expected utility.
Francesco Andreoli +3 more
wiley +1 more source
Strong geodetic number of complete bipartite graphs, crown graphs and hypercubes
, 2018 The strong geodetic number, $\text{sg}(G),$ of a graph $G$ is the smallest number of vertices such that by fixing one geodesic between each pair of selected vertices, all vertices of the graph are covered.
Gledel, Valentin, Iršič, Vesna
core