[go: up one dir, main page]

Braverman et al., 2018 - Google Patents

On simultaneous two-player combinatorial auctions

Braverman et al., 2018

View PDF
Document ID
7629035405134275755
Author
Braverman M
Mao J
Weinberg S
Publication year
Publication venue
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms

External Links

Snippet

We consider the following communication problem: Alice and Bob each have some valuation functions υ 1 (·) and υ 2 (·) over subsets of m items, and their goal is to partition the items into S, in a way that maximizes the welfare,. We study both the allocation problem …
Continue reading at epubs.siam.org (PDF) (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
    • G06F17/30958—Graphs; Linked lists
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
    • G06F17/30386—Retrieval requests
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/3061—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q30/00—Commerce, e.g. shopping or e-commerce
    • G06Q30/06—Buying, selling or leasing transactions
    • G06Q30/08—Auctions, matching or brokerage
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q30/00—Commerce, e.g. shopping or e-commerce
    • G06Q30/02—Marketing, e.g. market research and analysis, surveying, promotions, advertising, buyer profiling, customer management or rewards; Price estimation or determination
    • G06Q30/0202—Market predictions or demand forecasting
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/02—Details
    • H04L12/16—Arrangements for providing special services to substations contains provisionally no documents
    • H04L12/18—Arrangements for providing special services to substations contains provisionally no documents for broadcast or conference, e.g. multicast
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00—Systems or methods specially adapted for a specific business sector, e.g. utilities or tourism
    • G06Q50/01—Social networking
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/10—Office automation, e.g. computer aided management of electronic mail or groupware; Time management, e.g. calendars, reminders, meetings or time accounting

Similar Documents

Publication Publication Date Title
Braverman et al. On simultaneous two-player combinatorial auctions
Farhadi et al. Fair allocation of indivisible goods to asymmetric agents
Ezra et al. Online stochastic max-weight matching: prophet inequality for vertex and edge arrival models
Ashlagi et al. Clearing matching markets efficiently: informative signals and match recommendations
Goel et al. Metric distortion of social choice rules: Lower bounds and fairness properties
Dobzinski An impossibility result for truthful combinatorial auctions with submodular valuations
Karp et al. Noisy binary search and its applications
Anari et al. Mechanism design for crowdsourcing: An optimal 1-1/e competitive budget-feasible mechanism for large markets
Cai et al. Extreme-value theorems for optimal multidimensional pricing
Peng et al. Fast swap regret minimization and applications to approximate correlated equilibria
Dobzinski et al. Economic efficiency requires interaction
Dobzinski et al. Limitations of vcg-based mechanisms
Schulman et al. Allocation of divisible goods under lexicographic preferences
Chen et al. Optimal competitive auctions
Oren et al. Online (budgeted) social choice
Feige et al. Oblivious rounding and the integrality gap
Maehara et al. Budget allocation problem with multiple advertisers: A game theoretic view
Saha et al. Exploiting correlation to achieve faster learning rates in low-rank preference bandits
Dobzinski et al. Impossibility results for truthful combinatorial auctions with submodular valuations
Brandt et al. Finding optimal arms in non-stochastic combinatorial bandits with semi-bandit feedback and finite budget
Amanatidis et al. Don't roll the dice, ask twice: the two-query distortion of matching problems and beyond
Ada et al. The hardness of being private
Filos-Ratsikas et al. On the computation of equilibria in discrete first-price auctions
Christodoulou et al. On the Nisan-Ronen conjecture for submodular valuations
Becker et al. On the cost of demographic parity in influence maximization