Walrasian's Characterization and a Universal Ascending Auction

We introduce a novel characterization of all Walrasian price vectors in terms of forbidden over- and under demanded sets for monotone gross substitute combinatorial auctions. For ascending and descending auctions we suggest a universal framework for finding the minimum or maximum Walrasian price vec...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2016-05
Main Author: Ben-Zwi, Oren
Format: Article
Language:English
Subjects:
Auctions
Combinatorial analysis
Spectrum allocation
Substitutes
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page
container_issue
container_start_page
container_title arXiv.org
container_volume
creator Ben-Zwi, Oren
description We introduce a novel characterization of all Walrasian price vectors in terms of forbidden over- and under demanded sets for monotone gross substitute combinatorial auctions. For ascending and descending auctions we suggest a universal framework for finding the minimum or maximum Walrasian price vectors for monotone gross substitute combinatorial auctions. An ascending (descending) auction is guaranteed to find the minimum (maximum) Walrasian if and only if it follows the suggested framework.
format article
fullrecord <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2079260387</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2079260387</sourcerecordid><originalsourceid>FETCH-proquest_journals_20792603873</originalsourceid><addsrcrecordid>eNpjYuA0MjY21LUwMTLiYOAtLs4yMDAwMjM3MjU15mSwC0_MKUoszkzMUy9WcM5ILEpMLkktyqxKLMnMz1NIzEtRSFQIzcssSy0qTsxRcCxOTs1LycxLV3AsTQap4GFgTUvMKU7lhdLcDMpuriHOHroFRfmFpanFJfFZ-aVFeUCpeCMDc0sjMwNjC3Nj4lQBALiDOE4</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2079260387</pqid></control><display><type>article</type><title>Walrasian's Characterization and a Universal Ascending Auction</title><source>Publicly Available Content Database (Proquest) (PQ_SDU_P3)</source><creator>Ben-Zwi, Oren</creator><creatorcontrib>Ben-Zwi, Oren</creatorcontrib><description>We introduce a novel characterization of all Walrasian price vectors in terms of forbidden over- and under demanded sets for monotone gross substitute combinatorial auctions. For ascending and descending auctions we suggest a universal framework for finding the minimum or maximum Walrasian price vectors for monotone gross substitute combinatorial auctions. An ascending (descending) auction is guaranteed to find the minimum (maximum) Walrasian if and only if it follows the suggested framework.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Auctions ; Combinatorial analysis ; Spectrum allocation ; Substitutes</subject><ispartof>arXiv.org, 2016-05</ispartof><rights>2016. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.proquest.com/docview/2079260387?pq-origsite=primo$$EHTML$$P50$$Gproquest$$Hfree_for_read</linktohtml><link.rule.ids>780,784,25753,37012,44590</link.rule.ids></links><search><creatorcontrib>Ben-Zwi, Oren</creatorcontrib><title>Walrasian's Characterization and a Universal Ascending Auction</title><title>arXiv.org</title><description>We introduce a novel characterization of all Walrasian price vectors in terms of forbidden over- and under demanded sets for monotone gross substitute combinatorial auctions. For ascending and descending auctions we suggest a universal framework for finding the minimum or maximum Walrasian price vectors for monotone gross substitute combinatorial auctions. An ascending (descending) auction is guaranteed to find the minimum (maximum) Walrasian if and only if it follows the suggested framework.</description><subject>Auctions</subject><subject>Combinatorial analysis</subject><subject>Spectrum allocation</subject><subject>Substitutes</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2016</creationdate><recordtype>article</recordtype><sourceid>PIMPY</sourceid><recordid>eNpjYuA0MjY21LUwMTLiYOAtLs4yMDAwMjM3MjU15mSwC0_MKUoszkzMUy9WcM5ILEpMLkktyqxKLMnMz1NIzEtRSFQIzcssSy0qTsxRcCxOTs1LycxLV3AsTQap4GFgTUvMKU7lhdLcDMpuriHOHroFRfmFpanFJfFZ-aVFeUCpeCMDc0sjMwNjC3Nj4lQBALiDOE4</recordid><startdate>20160512</startdate><enddate>20160512</enddate><creator>Ben-Zwi, Oren</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20160512</creationdate><title>Walrasian's Characterization and a Universal Ascending Auction</title><author>Ben-Zwi, Oren</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_20792603873</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2016</creationdate><topic>Auctions</topic><topic>Combinatorial analysis</topic><topic>Spectrum allocation</topic><topic>Substitutes</topic><toplevel>online_resources</toplevel><creatorcontrib>Ben-Zwi, Oren</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>ProQuest Central Essentials</collection><collection>AUTh Library subscriptions: ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central</collection><collection>SciTech Premium Collection (Proquest) (PQ_SDU_P3)</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database (Proquest) (PQ_SDU_P3)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Ben-Zwi, Oren</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>Walrasian's Characterization and a Universal Ascending Auction</atitle><jtitle>arXiv.org</jtitle><date>2016-05-12</date><risdate>2016</risdate><eissn>2331-8422</eissn><abstract>We introduce a novel characterization of all Walrasian price vectors in terms of forbidden over- and under demanded sets for monotone gross substitute combinatorial auctions. For ascending and descending auctions we suggest a universal framework for finding the minimum or maximum Walrasian price vectors for monotone gross substitute combinatorial auctions. An ascending (descending) auction is guaranteed to find the minimum (maximum) Walrasian if and only if it follows the suggested framework.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2016-05
issn 2331-8422
language eng
recordid cdi_proquest_journals_2079260387
source Publicly Available Content Database (Proquest) (PQ_SDU_P3)
subjects Auctions
Combinatorial analysis
Spectrum allocation
Substitutes
title Walrasian's Characterization and a Universal Ascending Auction
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-02T15%3A10%3A21IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=Walrasian's%20Characterization%20and%20a%20Universal%20Ascending%20Auction&rft.jtitle=arXiv.org&rft.au=Ben-Zwi,%20Oren&rft.date=2016-05-12&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E2079260387%3C/proquest%3E%3Cgrp_id%3Ecdi_FETCH-proquest_journals_20792603873%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2079260387&rft_id=info:pmid/&rfr_iscdi=true