首页> 外文会议>Intelligent computer mathematics >A Qualitative Comparison of the Suitability of Four Theorem Provers for Basic Auction Theory

【24h】

A Qualitative Comparison of the Suitability of Four Theorem Provers for Basic Auction Theory

机译：基本拍卖理论的四个定理证明者适用性的定性比较

获取原文

获取原文并翻译 | 示例

页面导航

摘要
著录项
相似文献
相关主题

摘要

Novel auction schemes are constantly being designed. Their design has significant consequences for the allocation of goods and the revenues generated. But how to tell whether a new design has the desired properties, such as efficiency, i.e. allocating goods to those bidders who value them most? We say: by formal, machine-checked proofs. We investigated the suitability of the Isabelle, Theorema, Mizar, and Hets/CASL/ TPTP theorem provers for reproducing a key result of auction theory: Vickrey's 1961 theorem on the properties of second-price auctions. Based on our formalisation experience, taking an auction designer's perspective, we give recommendations on what system to use for formalising auctions, and outline further steps towards a complete auction theory toolbox.

机译：不断在设计新颖的拍卖方案。他们的设计对货物分配和产生的收入有重大影响。但是，如何判断新设计是否具有所需的属性，例如效率，即将商品分配给最看重它们的投标人呢？我们说：通过正式的，经过机器检查的证据。我们调查了Isabelle，Theorema，Mizar和Hets / CASL / TPTP定理证明者是否适合再现拍卖理论的一个关键结果：维克雷（Vickrey）1961年关于第二价格拍卖性质的定理。基于我们的形式化经验，从拍卖设计师的角度出发，我们对使用哪种系统形式化拍卖提出建议，并概述了朝着完整的拍卖理论工具箱迈进的步骤。

著录项

来源
《Intelligent computer mathematics》|2013年|200-215|共16页
会议地点 Bath(GB)
作者
Christoph Lange; Marco B. Caminati; Manfred Kerber; Till Mossakowski; Colin Rowat; Makarius Wenzel; Wolfgang Windsteiger;
展开▼
作者单位

Computer Science, University of Birmingham, UK;

Computer Science, University of Birmingham, UK;

University of Bremen and DFKI GmbH Bremen, Germany;

Economics, University of Birmingham, UK;

Univ. Paris-Sud, Laboratoire LRI, UMR8623, Orsay, F-91405, France;

RISC, Johannes Kepler University Linz (JKU), Austria;

展开▼
会议组织
原文格式 PDF
正文语种 eng
中图分类
关键词

相似文献

外文文献
中文文献
专利

1. Proving classical theorems of social choice theory in modal logic [J] . Cina Giovanni, Endriss Ulle Autonomous agents and multi-agent systems . 2016,第5期

机译：用模态逻辑证明社会选择理论的经典定理
2. A symbolic finite-state approach for automated proving of theorems in combinatorial game theory [J] . Thanatipanonda T, Zeilberger D Journal of difference equations and applications . 2009,第2期

机译：组合博弈论中自动证明定理的符号有限状态方法
3. Revising basic theorem proving algorithms to cope with the logic of partial functions [J] . Cliff B. Jones, Matthew J. Lovert, L. Jason Steggles Science of Computer Programming . 2014,第pta2期

机译：修改基本定理证明算法以应对部分函数的逻辑
4. A Qualitative Comparison of the Suitability of Four Theorem Provers for Basic Auction Theory [C] . Christoph Lange, Marco B. Caminati, Manfred Kerber, Symposium on the Integration of Symbolic Computation and Mechanized Reasoning . 2013

机译：基本拍卖理论的四个定理铅适用性的定性比较
5. Using experimental mathematics to conjecture and prove theorems in the theory of partitions and commutative and non-commutative recurrences. [D] . Russell, Matthew Christopher. 2016

机译：用实验数学猜想和证明定理在分配和可交换与非可交换递归理论中。
6. Unification Theorem for the Two Basic Dualities of Homothetic Demand Theory [O] . Paul A. Samuelson 1972

机译：同质需求理论的两个基本对偶的统一定理
7. A qualitative comparison of the suitability of four theorem provers for basic auction theory [O] . Christoph Lange, Marco B. Caminati, Manfred Kerber, 2013

机译：四种定理证明器对基本拍卖理论适用性的定性比较

A Qualitative Comparison of the Suitability of Four Theorem Provers for Basic Auction Theory

摘要

著录项

相似文献

相关主题

期刊订阅