Physical Sciences and Mathematics Commons^™

Reducing Price Fluctuation In Continuous Double Auctions Through Pricing Policy And Shout Improvement, Jinzhong Niu, Kai Cai, Simon Parsons, Elizabeth Sklar

Publications and Research

Auction mechanism design is a subfield of game theory dedicated to manipulating the rules of an auction so as to achieve specific goals. The complexity of the dynamics of auctions, especially continuous double auctions, makes it difficult to apply the usual analytic game-theoretic methods. This paper takes an experimental approach, searching a parameterized space of possible auction types, and presents a new pricing policy for continuous double auctions. The paper further demonstrates how this policy, together with a shout improvement rule, helps to reduce the fluctuation of transaction prices in auctions involving agents with minimum intelligence while keeping the overall …

Tr-2006003: Explicit Proofs In Formal Provability Logic, Evan Goris

Computer Science Technical Reports

No abstract provided.

Tr-2006007: Root-Finding With Eigen-Solving, Victor Y. Pan, Brian Murphy, Rhys Eric Rosholt

Computer Science Technical Reports

No abstract provided.

Tr-2006008: Every P-Recursion Category Has An Index Composer, Florian Lengyel

Computer Science Technical Reports

No abstract provided.

Tr-2006005: Logical Omniscience Via Proof Complexity, Sergei Artemov, Roman Kuznets

Computer Science Technical Reports

No abstract provided.

Tr-2006006: Additive Preconditioning And Aggregation In Matrix Computations, Victor Y. Pan, Dmitriy Ivolgin, Brian Murphy, Rhys Eric Rosholt, Islam Taj-Eddin, Yuqing Tang, Xiaodong Yan

Computer Science Technical Reports

No abstract provided.

Tr-2006012: Every P-Recursion Category Has An Index Composer, Florian Lengyel

Computer Science Technical Reports

No abstract provided.

Tr-2006001: The Em Algorithm As A Lower Bound Optimization Technique, Rave Harpaz, Robert Haralick

Computer Science Technical Reports

No abstract provided.

Tr-2006002: A Replacement Theorem For Lp, Melvin Fitting

Computer Science Technical Reports

No abstract provided.

Tr-2006004: Justified Knowledge Is Sufficient, Evangelia Antonakos

Computer Science Technical Reports

No abstract provided.

Tr-2006011: Locally Connected Recursion Categories, Florian Lengyel

Computer Science Technical Reports

No abstract provided.

Tr-2006013: The Dom Event And Its Use In Implementing Constraint Propagators, Neng-Fa Zhou, Mark Wallace, Peter J. Stuckey

Computer Science Technical Reports

No abstract provided.

Tr-2006014: Geometric Considerations For Distribution Of Sensors In Ad-Hoc Sensor Networks, Ted Brown, Deniz Sarioz, Amotz Bar-Noy, Tom Laporta, Dinesh Verma, Matthew Johnson, Hosam Rowaihy

Computer Science Technical Reports

No abstract provided.

Typography Behind The Arabetic Calligraphy Veil, Saad D. Abulhab

Publications and Research

In the change from scriptural writing systems to textual mechanical systems and most recently to digital, computer generated text, some languages and their typographic representations have suffered. One such language, along with its visible language representation, that has not made a smooth transition is Arabic. The author argues that misinterpreting language tradition prevents what he calls Arabetic typography from embracing an appropriate technological adaptation. Putting forth an evolutionary argument, he critiques the notion that calligraphic styles must prevail and that legibility and readability of Arabic characters is objective. He further states that the resulting typefaces when abandoning the so called …

The History Of Computer Games, Jill Cirasella, Danny Kopec

Publications and Research

This handout presents milestones in the history of computer backgammon, computer bridge, computer checkers, computer chess, computer Go, computer Othello, and computer poker.

Classical And Quantum Algorithms For Finding Cycles, Jill Cirasella

Publications and Research

Quantum computing—so weird, so wonderful—inspires much speculation about the line between the possible and the impossible. (Of course, there is still unclarity about how “impossible” intractable problems are and about how “possible” quantum computers are.) This thesis takes a slightly different tack: instead of focusing on how to make the impossible possible, it focuses on how to make the possible easier.

More specifically, this paper discusses quantum algorithms for finding cycles in graphs, a problem for which polynomial-time classical algorithms already exist. It explains and compares the classical and quantum algorithms, and it introduces a few new algorithms and observations. …