Efficiently identifying deterministic real-time automata from labeled data

We develop a novel learning algorithm RTI for identifying a deterministic real-time automaton (DRTA) from labeled time-stamped event sequences. The RTI algorithm is based on the current state of the art in deterministic finite-state automaton (DFA) identification, called evidence-driven state-merging (EDSM). In addition to having a DFA structure...

Approximating the Qualitative Vickrey Auction by a Negotiation Protocol

A result of Bulow and Klemperer has suggested that auctions may be a better tool to obtain an efficient outcome than negotiation. For example, some auction mechanisms can be shown to be efficient and strategy-proof. However, they generally also require that additional constraints are met which are not always easy to guarantee in practice. It...

Qualitative One-to-Many Multi-Issue Negotiation: Approximating the QVA

When there is one buyer interested in obtaining a service from one of a set of sellers, multi-attribute or multi-issue auctions can ensure an allocation that is efficient. Even when there is no transferable utility (e.g., money), a recent qualitative version of the Vickrey auction may be used, the QVA, to obtain a Pareto-efficient outcome where...

Work in Progress: Learner-Centered Online Learning Facility

This paper describes a novel, learner-centered technology for authoring web lectures. Besides seamless integration of video and audio feeds, Microsoft PowerPoint slides, and web-pages, the proposed Online Learning Facility (OLF) also facilitates online interactive testing and review of covered materials, online provision of feedback, real-time...