On social envy-freeness in multi-unit markets (Q2321269): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.artint.2018.12.003 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.artint.2018.12.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2903990934 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mechanisms for Multi-Unit Auctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-unit auctions with budget limits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-unit auctions: beyond Roberts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clinching Auctions with Online Supply / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incentives in Teams / rank
 
Normal rank
Property / cites work
 
Property / cites work: A resource allocation queueing fairness measure: properties and bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4931752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921790 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform Budgets and the Envy-Free Pricing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Envy-Free Pricing in Multi-item Markets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5111298 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Revenue Maximizing Envy-Free Fixed-Price Auctions with Budgets / rank
 
Normal rank
Property / cites work
 
Property / cites work: When ignorance helps: graphical multicast cost sharing games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphical congestion games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Game Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Truth revelation in approximately efficient combinatorial auctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Approximate Truthful Mechanism for Combinatorial Auctions with Single Parameter Agents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Truthful approximation mechanisms for restricted combinatorial auctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On complexity of single-minded auction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Knapsack auctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relations between average case complexity and approximation complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combination Can Be Hard: Approximability of the Unique Coverage Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Sell a Graph: Guidelines for Graph Retailers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Revenue Maximizing Envy-Free Pricing in Matching Markets with Budgets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4608566 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The efficiency of fair division / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed fair allocation of indivisible goods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the revenue maximization problem with sharp demands / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5005149 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximation Algorithms for Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on maximizing a submodular set function subject to a knapsack constraint / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128749594 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.ARTINT.2018.12.003 / rank
 
Normal rank

Latest revision as of 00:09, 18 December 2024

scientific article
Language Label Description Also known as
English
On social envy-freeness in multi-unit markets
scientific article

    Statements

    On social envy-freeness in multi-unit markets (English)
    0 references
    0 references
    0 references
    0 references
    28 August 2019
    0 references
    multiagent systems
    0 references
    multiagent resource allocation
    0 references
    envy-freeness
    0 references
    fair division
    0 references
    social networks
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers