Multiagent Evaluation Mechanisms

We consider settings where agents are evaluated based on observed features, and assume they seek to achieve feature values that bring about good evaluations. Our goal is to craft evaluation mechanisms that incentivize the agents to invest effort in desirable actions; a notable application is the design of course grading schemes. Previous work has studied this problem in the case of a single agent. By contrast, we investigate the general, multi-agent model, and provide a complete characterization of its computational complexity.

Download Full-text

A logic of knowledge based on abstract arguments

Journal of Logic and Computation ◽

10.1093/logcom/exab002 ◽

2021 ◽

Author(s):

Yì N Wáng ◽

Xu Li

Keyword(s):

Computational Complexity ◽

Model Checking ◽

True Belief ◽

Logical Omniscience ◽

Knowledge Based ◽

Logic Of Knowledge ◽

Multi Agent ◽

Soundness And Completeness ◽

Base Logic

Abstract We introduce a logic of knowledge in a framework in which knowledge is treated as a kind of belief. The framework is based on a standard KD45 characterization of belief, and the characterization of knowledge undergoes the classical tripartite analysis that knowledge is justified true belief, which has a natural link to the studies of logics of evidence and justification. The interpretation of knowledge avoids the unwanted properties of logical omniscience, independent of the choice of the base logic of belief. We axiomatize the logic, prove its soundness and completeness and study the computational complexity results of the model checking and satisfiability problems. We extend the logic to a multi-agent setting and introduce a variant in which belief is characterized in a weaker system to avoid the problem of logical omniscience.

Download Full-text

Computing the Interleaving Distance is NP-Hard

Foundations of Computational Mathematics ◽

10.1007/s10208-019-09442-y ◽

2019 ◽

Vol 20 (5) ◽

pp. 1237-1271 ◽

Cited By ~ 3

Author(s):

Håvard Bakke Bjerkevik ◽

Magnus Bakke Botnan ◽

Michael Kerber

Keyword(s):

Computational Complexity ◽

Complete Characterization ◽

Np Hard ◽

Slight Improvement ◽

Approximation Factor ◽

Distance Computation ◽

Persistence Modules ◽

Np Complete ◽

Interleaving Distance

Abstract We show that computing the interleaving distance between two multi-graded persistence modules is NP-hard. More precisely, we show that deciding whether two modules are 1-interleaved is NP-complete, already for bigraded, interval decomposable modules. Our proof is based on previous work showing that a constrained matrix invertibility problem can be reduced to the interleaving distance computation of a special type of persistence modules. We show that this matrix invertibility problem is NP-complete. We also give a slight improvement in the above reduction, showing that also the approximation of the interleaving distance is NP-hard for any approximation factor smaller than 3. Additionally, we obtain corresponding hardness results for the case that the modules are indecomposable, and in the setting of one-sided stability. Furthermore, we show that checking for injections (resp. surjections) between persistence modules is NP-hard. In conjunction with earlier results from computational algebra this gives a complete characterization of the computational complexity of one-sided stability. Lastly, we show that it is in general NP-hard to approximate distances induced by noise systems within a factor of 2.

Download Full-text

A Stochastic Model for Service Contract

International Journal of Reliability Quality and Safety Engineering ◽

10.1142/s0218539398000054 ◽

1998 ◽

Vol 05 (01) ◽

pp. 29-45 ◽

Cited By ~ 25

Author(s):

D. N. P. Murthy ◽

E. Asgharizadeh

Keyword(s):

Sensitivity Analysis ◽

Simple Model ◽

Single Agent ◽

Optimal Strategies ◽

Complete Characterization ◽

Viable Option ◽

Service Contract ◽

External Agent ◽

Maintenance Service

When it is not economical to carry out maintenance in-house, out-sourcing to an external agent is an alternate viable option. In this paper, we study a simple maintenance service contract involving a single agent (providing the maintenance service) and a single customer (owner of the equipment and recipient of the maintenance service). We develop a simple model to obtain the optimal strategies for both the customer and the agent. We give a complete characterization of the strategies along with some sensitivity analysis and discuss some extensions.

Download Full-text

Introducing k-lingo: a k-depth Bounded Version of ASP System Clingo

10.24963/kr.2021/65 ◽

2021 ◽

Author(s):

Fabio Aurelio D'Asaro ◽

Paolo Baldi ◽

Giuseppe Primiero

Keyword(s):

Computational Complexity ◽

Propositional Logic ◽

Multi Agent Systems ◽

Classical Propositional Logic ◽

Rational Agents ◽

Agent Systems ◽

Multi Agent ◽

Future Work ◽

Limited Depth

Depth-Bounded Boolean Logics (DBBL for short) are well-understood frameworks to model rational agents equipped with limited deductive capabilities. These Logics use a parameter k>=0 to limit the amount of virtual information, i.e., the information that the agent may temporarily assume throughout the deductive process. This restriction brings several advantageous properties over classical Propositional Logic, including polynomial decision procedures for deducibility and refutability. Inspired by DBBL, we propose a limited-depth version of the popular ASP system \clingo, tentatively dubbed k-lingo after the bound k on virtual information. We illustrate the connection between DBBL and ASP through examples involving both proof-theoretical and implementative aspects. The paper concludes with some comments on future work, which include a computational complexity characterization of the system, applications to multi-agent systems and feasible approximations of probability functions.

Download Full-text

Market Competition and Lower Tier Incentives

The B E Journal of Theoretical Economics ◽

10.2202/1935-1704.1471 ◽

2009 ◽

Vol 9 (1) ◽

Author(s):

Bernd Theilen

Keyword(s):

Market Competition ◽

Single Agent ◽

Incentive Pay ◽

Incentive Payment ◽

Agent Model ◽

Lower Tier ◽

Payment Schemes ◽

Multi Agent ◽

Firm Data ◽

And Performance

The relationship between competition and performancerelated pay has been analyzed in singleprincipalsingleagent models. While this approach yields good predictions for managerial pay schemes, the predictions fail to apply for employees at lower tiers of a firm's hierarchy. This paper describes a principal multi-agent model of incentive pay that analyzes the effect of changes in the competitiveness of markets on lower tier incentive payment schemes. The results explain why the payment schemes of agents located at low and mid tiers are less sensitive to changes in competition when aggregated firm data is used.

Download Full-text

Experimental Characterization of Mechanical Behavior of Cord-Rubber Composites

Tire Science and Technology ◽

10.2346/1.2150974 ◽

1982 ◽

Vol 10 (1) ◽

pp. 37-54 ◽

Cited By ~ 11

Author(s):

M. Kumar ◽

C. W. Bert

Keyword(s):

Response Characteristic ◽

Cord Compression ◽

Complete Characterization ◽

Strain Response ◽

Strain Gages ◽

Experimental Characterization ◽

Rubber Composites ◽

Stress Strain ◽

Strain Data

Abstract Unidirectional cord-rubber specimens in the form of tensile coupons and sandwich beams were used. Using specimens with the cords oriented at 0°, 45°, and 90° to the loading direction and appropriate data reduction, we were able to obtain complete characterization for the in-plane stress-strain response of single-ply, unidirectional cord-rubber composites. All strains were measured by means of liquid mercury strain gages, for which the nonlinear strain response characteristic was obtained by calibration. Stress-strain data were obtained for the cases of both cord tension and cord compression. Materials investigated were aramid-rubber, polyester-rubber, and steel-rubber.

Download Full-text

H∞ performance of weighted interval plants: complete characterization of vertex results

1993 American Control Conference ◽

10.23919/acc.1993.4792931 ◽

1993 ◽

Cited By ~ 3

Author(s):

C. V. Hollot ◽

R. Tempo

Keyword(s):

Complete Characterization ◽

Interval Plants

Download Full-text

Characterization of CMOS Structures (0.6 µm process) Submitted to HBM and COM ESD Stress Tests

ISTFA 1997: Conference Proceedings from the 23rd International Symposium for Testing and Failure Analysis ◽

10.31399/asm.cp.istfa1997p0315 ◽

1997 ◽

Author(s):

G. Meneghesso ◽

E. Zanoni ◽

P. Colombo ◽

M. Brambilla ◽

R. Annunziata ◽

...

Keyword(s):

Electron Microscopy ◽

Electrostatic Discharge ◽

Stress Test ◽

Complete Characterization ◽

Stress Tests ◽

Test Procedures ◽

Emission Microscopy ◽

Fast Rise ◽

Scanning Electron

Abstract In this work, we present new results concerning electrostatic discharge (ESD) robustness of 0.6 μm CMOS structures. Devices have been tested according to both HBM and socketed CDM (sCDM) ESD test procedures. Test structures have been submitted to a complete characterization consisting in: 1) measurement of the tum-on time of the protection structures submitted to pulses with very fast rise times; 2) ESD stress test with the HBM and sCDM models; 3) failure analysis based on emission microscopy (EMMI) and Scanning Electron Microscopy (SEM).

Download Full-text